Next: Index, Previous: Algorithmic Problem Index, Up: Top
Dijkstra's single source shortest path alg: DijkstraSSSPheap data structure: Heap priority queueheap_sort: heap_sort general ideaHoare_partition: quick_partitioninsert: insertinsertion_sort: insertion_sortintrospective_sort: introspective_sortKruskal's minimal spanning tree algorithm: KruskalMSTmerge: mergemerge_sort: merge_sortmerge_sort, bottom up: bottom up merge_sortPrim's Minimal Spanning Tree alg: PrimMSTquick_partition: quick_partitionquick_partition (Hoare): quick_selectquick_select: quick_selectquick_sort: quick_sortquick_sort with Hoare partition: quick_sort