Searching Techniques
Dijkstra Shortest Path
Comments powered by Disqus.
Linear Search A sequential search is made over all items one by one. Every item is checked and if a match is found then the item is returned. Otherwise, the search continues to the end. with O(n)...
Shortest path by Dijkstra: The goal is to find the shortest path between two vertices. The objective is to find the shortest path from the starting vertices to any vertices. An example of greedy al...
Sorting Techniques Using the built in sort is okay with small data is okay. But when it comes to big data the built in sort is very expensive, the Big O! Sorting is arranging data in a particular...
