procedure dfs(vertex v)
{
mark v as visited
for each w adjacent to v
if w unvisited
dfs(w)
}
procedure BFS(vertex s){
create a queue Q
enqueue s onto Q
mark s as visited
while Q is not empty
{
dequeue a vertex from Q into v
for each w adjacent to v
{
if w unvisited
{
mark w as visited
enqueue w onto Q
}
}
}
} |
| Finding MST using Kruskal's algorithm |
 |
| "Red is current min. Yellow is sorted list. Blue is current item." ~Wikipedia |
| Best case | Average Case | Worst Case | |
|---|---|---|---|
| Quick Sort | O(n log(n)) | O(n log(n)) | O(n²) |
| Merge Sort | O(n log(n)) | O(n log(n)) | O(n log(n)) |
| Insertion Sort | O(n) | O(n²) | O(n²) |
| Selection Sort | O(n²) | O(n²) | O(n²) |
| Bubble Sort | O(n) | O(n²) | O(n²) |
