Please enable JavaScript.
Coggle requires JavaScript to display documents.
Searching Algorithms - searching is the process of determining whether or…
Searching Algorithms - searching is the process of determining whether or not a given value (object) exists in a data structure
-
Binary Search
-
-
Big O complexity: O(logN), best case O(1)
-
Dijkstra' Algorithm
a graph search algorithm that solves the single source shortest path problem for a graph, producing a shortest path tree
iteratively grows a 'cloud' of vertices out of s (start node), with the vertices entering the cloud in order of their distance from s
in each iteration, the next vertex chosen is the one outside the cloud that is closest to s
-
Greedy Method - picks the next object in the function that optimizes the function from among those yet to be chosen
-