tmhscs@gmail.com sort > sort_selectionSort
prev  |  next  |  chance

Given an integer array, sort it from least to greatest using the Selection Sort Algorithm. If you do not solve it using Selection Sort, then you will not receive credit. sort_selectionSort([3, 2, 1]) → [1, 2, 3] sort_selectionSort([5, 4, 9, 6, 8, 4, 2, 5, 1, 2, 5, 3, 2, 1]) → [1, 1, 2, 2, 2, 3, 4, 4, 5, 5, 5, 6, 8, 9] sort_selectionSort([1, 1, 2, 2, 2, 3, 4, 4, 5, 5, 5, 6, 8, 9]) → [1, 1, 2, 2, 2, 3, 4, 4, 5, 5, 5, 6, 8, 9] Go...Save, Compile, Run (ctrl-enter)Show Hint public int[] sort_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)

Post-solution available

Copyright Nick Parlante 2017 - privacy