Note
Binary Search
Moves through the list until the wanted item is found using divide and conquer . Implementation Advantages Fast on larger datasets O 1 best case scenario, O log n worst case scenar...
computer-sciencealgorithmssearch
Tag view
algorithms
7 related notes
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
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
Linear Search
Iterates through the list until the wanted item is found. Implementation Advantages Easy to program Fast on small datasets O 1 space Disadvantages O n slow on large datasets
computer-sciencealgorithmssearch
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
Page Rank
Calculation The PageRank formula refines itself over time, considering current page scores. Factors In bound links Main factor, most effectual in PageRank Frequency and magnitude o...
computer-scienceweb-technologiesalgorithms
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