Karteikarten
Runtime
Karten in diesem Stapel (15)
- 1Inserting an element into a max heapO(logn)
- 2Removing the max element from a max heapO(logn)
- 3Inserting n elements one at a time into an initially empty max heapO(nlogn)
- 4Building an n-element max heap bottom-upO(n)
- 5insertion sort (worst-case)O(n^2)
- 6Insertion sort (best-case)O(n)
- 7Heapsort (worst-case)O(nlogn)
- 8Mergesort (worst-case)O(nlogn)
- 9Quicksort (worst-case)O(n^2)
- 10Quicksort (average-case)O(nlogn)
- 11Quickselect (average-case)O(n)
- 12Counting sort (worst-case)O(n+k)
- 13Bucket sort (n uniformly-distributed elements, n buckets) (average-case)O(n)
- 14inserting an element into a hash tableO(n/m)
- 15Suppose you want to find the shortest path from vertex s to vertex t in an unweighted undirected graph. If you use bidirectional search, what is the runtime? Give your answer in big O notation as a function of b (the branching factor) and d (the length of the shortest path).O(b^d/2)
Informationen
- Beschreibung
- Computer Science Karteikarten am Runtime, erstellt von President QC am 15/05/2019.
- Erstellt von
- President QC
- Aufrufe
- 12
- Bewertung