AlgoPrep - Algos, DS Made Easy

Pranit Krishna Kulkarni

About this app

Are you a Computer science/IT/ programming student or preparing for a Software Engineer interview ?

This tool will help you to see how the following algorithms will sort a set of numbers
1. Bubble sort
2. Improved bubble sort
3. Insertion sort
4. Selection sort
5. Quick sort
6. Merge sort
7. Heap sort
Searching algorithms:
Binary Search, Jump Search & Linear Search

You can see how the sorting algorithm works step-by-step, real time visualization of the sorting and the different cases of time complexity of the algorithm.
(Best case, Worst case and Average case)

Also, go through some data structures like stacks, linked-lists, queues, trees, graphs and understand how it works.(More updates to come in future)

Tree traversals:
Inorder, pre-order & post-order

Graph traversals:
Depth First Search, Breadth First Search

So why just check pseudocode online ? See how it plays with the numbers visually.

--- App founded in 2017 ---

** NO INTERNET CONNECTION NEEDED **
** WORKS OFFLINE **

Ratings and reviews

It has the potential to be a great algorithm learning tool. Unlike the others this allows the user to input information, shows a step by step process then gives output data, fast and efficiently. Simple and organized UI , making it easy to navigate and access the information given. The only problem IT LACKS INFORMATION! If there were more detailed information given, or FAQ for beginners in the options colemn, I would give 5/5 stars.

This app literally blew my mind🤩! I'm a visual learner so this really helped me in visualising common algorithms step-by-step & their runtimes. It also explains abstract data structures well. I highly recommend it to anyone wanting to master algorithms & data structures quickly & comprehensively. A huge thanks to the dev(s) behind this masterpiece.

It's ok. Clear animation of algorithms. Some fundamental errors in the information, which is bad for learners e.g. best case for bubble sort is given as O(n^2), which is incorrect. It is actually O(n). If the errors were fixed I'd give it 4.

What’s new

Support developer page and under the hood updates.