ITM 207 Lecture Notes - Lecture 9: Sorting Algorithm, Selection Sort, Bubble Sort

• School: Ryerson University
• Department: Information Technology Management
• Course: ITM 207
• Professor: Joseph Lee

Document Summary

This is a very specific application of algorithm. These are extremely important in the day to day experience: google uses this. If u have millions of records, that u use to decide, u would need a strategy to put this into order. There are many sorting algorithms: the one we use today explains how we deal with the problem at hand. The arrays are a straightforward way of sorting things. Java is a huge set of bags, that can be used to sort things. In reality u do not see what is in bag, until u take the element out and find out what the element is. U just see them in the array to see what they are doing. In this example u would have to swap the numbers, in order to set in ascending form: the array is sorted into s specific order. U cannot sort the array in one shot.