Run these notebooks online -
Python implementation of the examples in the text book Fundamentals of Data Structures in C++ by E.Horowitz, S.Sahni and Mehta.
This is a part of my contribution to the textbook companionship project organized by the FOSSEE initiative of IIT Bombay.
Plotting the Fibonacci Spiral in Python!
Profiling the time cost of sequential search
The LaTeX enabled Polynomial module
Find vs Fast Find
Maze Path Finder (Application of stack)
Visualizing Heap sort using graph viz plots
The input array ( Represented as dictionary ) :
{1: 26, 2: 5, 3: 77, 4: 1, 5: 61, 6: 11, 7: 59, 8: 15, 9: 48, 10: 19}
(One of the intermediate steps)
Sorted : [77, 61, 59, 48, 26]
(Final step and the sorted array)
Sorted : [77, 61, 59, 48, 26, 19, 15, 11, 5]
The final sorted array is : [77, 61, 59, 48, 26, 19, 15, 11, 5, 1]
RSA hash generation flowchart in Python!!
Hashmap collision avoidance using chaining
If you wish to contribute too, visit FOSSEE and see if you can find anything matching your interests.
The copyrights for all the codes belong to the FOSSEE Department of IIT Bombay.