Illustrates Algorithm Something about basic data structures like stacks, queues, heaps. Graphs are a tremendousily useful concept and two-three tree solves a lot of problems inherent in more basic binary trees. All algorithms efficiecy and sorting and searching algorithms. Advanced algorithms such as Dijktra’s algorithm for finding shortest paths in graphs, dynamic programing with an example of all pairs shortest paths, minimum spanning trees and prim’s algorithm, huffman encoding compressing algorithm…



Leave a Reply