Certificate of completion
Leonardo
Algorithms II: MergeSort, QuickSort, Binary Search and Algorithm Analysis
completed the online course with an estimated workload of 12 hours.
Finished at July 06, 2018
Course lessons
Algorithms II: MergeSort, QuickSort, Binary Search and Algorithm Analysis
- Sorting playing cards, playing hole, game of life, exams etc.
- Interleaving based on a single array
- Simulating various interleaves
- Merge Sort
- Finding the relative position of an element.
- Placing an element in its place the pivot
- Quick Sort
- The linear search
- The binary search
- Search analysis
- Analysis of divisions
- Analysis of sorting algorithms.
