Algorithms & Data Structures Series
Inspired by Algorithms, Part I course from Princeton University.
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations . Part I covers elementary data structures, sorting, and searching algorithms. — coursera.
One last note to mention, I’m by no means an expert and I’m still learning, and part of learning process is sharing and trying to communicate what you’ve learnt so far.
The list of articles in the series are as the following:
- Dynamic Connectivity Problem
- Stacks and Queues
- — The Power Of Generics
- — Iterators
- — Comparing Objects
- The Angry Birds (The Sorting Algorithms)
- — Shuffling
- The Angry Birds — Red
- — Stability
- The Angry Birds — Chuck
- Priority Queues
- — Immutable
- The Angry Birds — Mighty Eagle
- Which Bird (Sorting Algorithm) Will Be Your Weapon?
- — Equality Test
- Symbol Tables (Associative Arrays)
- Binary Search Trees
- Balanced Search Trees
- Geometric Applications of BSTs
- Hash Tables
- Symbol Table Applications
- ⚠ The Built-in Standard Libraries Can Trick You!
The articles starts with “ — ” aren’t main topics but they support the overall understanding of other articles in the course. It’s not recommended to skip any of them while following along.
It’s worth to mention that these articles will be kept updated when there is a bug, misspelling, grammar mistake, or any other issue.
If you enjoyed this series, or I saved your time, please support by spreading the word. If you found something you want to report about, don’t hesitate to reply or send me an email at firstname.lastname@example.org.
Your feedback is highly appreciated.