Description
In this course, you will learn :
- To efficiently answer questions, learn how to store and manipulate data.
- How quickly does an algorithm execute? To answer this question, use the language that computer scientists use!
- You'll begin with the fundamentals, such as arrays and sorting, and progress to more complex data types and data structures.
- You'll have discovered algorithms that can be used to quickly store data, efficiently rearrange it, and easily access it.
Syllabus :
1. Intro to Algorithms
- Arrays
- Searching
- Insertion Sort
- The Speed of Algorithms
2. Recursion
- Recursion
- Divide and Conquer
- Mergesort
- Quicksort
3. Stacks and Queues
- Stacks
- Queues
4. Binary Trees
- Binary Trees
- Traversals
- Binary Search Trees
- Tree Rotations
5. Heaps
- Priority Queues
- Binary Heaps
- Treaps