norm.krumpe@muohio.edu sortsearchprep > selectionSort
prev  |  next  |  chance

Implement the selection sort algorithm using recursion. <p> Normally, sorting algorithms should have return type void. But codingbat doesn't work that way. So, return the array at the end of the method. selectionSort([47, 2, 18, 6, 3, 59, 2, 8, 19, 5]) → [2, 2, 3, 5, 6, 8, 18, 19, 47, 59] selectionSort([4, 3, 2, 1]) → [1, 2, 3, 4] selectionSort([5]) → [5] Go...Save, Compile, Run (ctrl-enter) int[] selectionSort(int[] nums) { } Go Editor font size %:75100125150 Shorter output

Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

• Java Example Solution Code
• Java String Introduction (video)
• Java Substring v2 (video)
• Java String Equals and Loops
• Java String indexOf and Parsing
• Java If and Boolean Logic
•   If Boolean Logic Example Solution Code 1 (video)
•   If Boolean Logic Example Solution Code 2 (video)
• Java For and While Loops
• Java Arrays and Loops
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

• Code Badges
• Introduction to Mod (video)
• MakeBricks problem and solution (video x 2)
• FizzBuzz the famous code interview question (video)

Difficulty: 200

Copyright Nick Parlante 2017 - privacy