Science Quiz / Runtime

Random Science Quiz

Can you name the Runtime?

Quiz not verified by Sporcle

Forced Order
Challenge
Share
Tweet
Embed
Score 0/35 Timer 10:00
Hint
Bucket sort
Huffman-coding
Build-Max/Min-Heap
Shortest path, Dijkstra - Min-heap
Dijkstra's algorithm finds longest way, one-to-all. Yes or no?
What does Huffman-coding find?
Quicksort, worst case
Find number of connected components in a connected, directed graph
Shortest path in a DAG
Counting sort
What does Kruskal's algorithm find?
Kruskal's algorithm
Heapify
Prim's algorithm, binary heap
Heapsort
BFS with neighbour list
Insertion sort
Prim's algorithm, neighbour matrix
Hint
Topological Sort
Edmonds-Karp algorithm
Quicksort, average case
Radix sort
What does Edmonds-Karp algorithm find?
Shortest path, all-to-all, Floyd-Warshall
BFS with neighbour matrix
Shortest path, Dijkstra - array
Find number of connected components in a connected DAG
Bubble sort, worst case
Shortest path, Bellman-Ford
Shortest path, Dijkstra - Fibonacci heap
Find number of connected components in a connected undirected graph
Prim's algorithm, fibonacci heap
Mergesort
Selection sort
Shortest path, Dijkstra - sorted array

You're not logged in!

Compare scores with friends on all Sporcle quizzes.
Sign Up with Email
OR
Log In

You Might Also Like...

Show Comments

Extras

Top Quizzes Today


Score Distribution

Your Account Isn't Verified!

In order to create a playlist on Sporcle, you need to verify the email address you used during registration. Go to your Sporcle Settings to finish the process.