The videos in this section deal with algorithms and algorithm analysis. Generally speaking, an algorithm is a well-defined series of steps to performing a specific task. In computer science, these steps are typically composed of instructions, loops, and branches, which can be described in pseudocode. Algorithms are analyzed for speed via mathematical methods for counting the number of steps on a large scale, also known as asymptotic analysis.

- Lesson 1: Bubblesort
- Lesson 2: Insertion Sort
- Lesson 3: Merge Sort
- Lesson 4: Quicksort
- Lesson 5: Linear and Binary Searching
- Lesson 6: Big O, Big Omega, and Big Theta Notation
- Lesson 7: Analyzing Bubblesort
- Lesson 8: Selection Sort
- Lesson 9: Heaps
- Lesson 10: Heapsort
- Lesson 11: Quicksort (General Algorithm)
- Lesson 12: Optimal Comparison Sort

© 2007–2024 XoaX.net LLC. All rights reserved.