Note
Bubble Sort
Iterates through the list, swapping the items if valid i.e., ascending and the first number is larger . This must be performed multiple times to fully sort a list, to decide whethe...
computer-sciencealgorithmssorts
Tag view
sorts
5 related notes
Note
Insertion Sort
Iterates through the list, starting at the second item and then iterating backwards and inserting before the last valid i.e. larger if ascending number. Implementation Advantages F...
computer-sciencealgorithmssorts
Note
Merge Sort
A sort composed of breaking down an array into minimal sets 2, if remainder then 3 , then sorting and popping the smallest number when joining. Implementation Advantages Fast on la...
computer-sciencealgorithmssorts
Note
Quick Sort
A sort based around sorting values into values smaller and larger than a pivot point. It is recursive, repeating until handling a list/segment of one. Explanation info To explain....
computer-sciencealgorithmssorts
Note
Search Engine Indexing
Drawing
computer-scienceweb-technologiessearch-engineindexing