{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

DescendingSorts

# DescendingSorts - if(numbers[scan> numbers[min min = scan...

This preview shows page 1. Sign up to view the full content.

//******************************************************************** // DescendingSorts.java Author: Lewis/Loftus // // Solution to Programming Project 6.3 // // Sorts in descending order. Demonstrates the selection sort // and insertion sort algorithms. //******************************************************************** / public class DescendingSorts { //----------------------------------------------------------------- // Sorts the specified array of integers in descending order // using the selection sort algorithm. //----------------------------------------------------------------- public static void selectionSort (int[] numbers) { int min, temp; for (int index = 0; index < numbers.length-1; index++) { min = index; for (int scan = index+1; scan < numbers.length; scan++)
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: if (numbers[scan] > numbers[min]) min = scan; // Swap the values temp = numbers[min]; numbers[min] = numbers[index]; numbers[index] = temp; } } //-----------------------------------------------------------------// Sorts the specified array of integers in descending order // using the insertion sort algorithm. //-----------------------------------------------------------------public static void insertionSort (int numbers) { for (int index = 1; index < numbers.length; index++) { int key = numbers[index]; int position = index; // shift larger values to the right while (position > 0 && numbers[position-1] < key) { numbers[position] = numbers[position-1]; position--; } numbers[position] = key; } } }...
View Full Document

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern