Science Quiz / Runtime

Random Science Quiz

QUIZ: Can you name the Runtime?

Quiz not verified by Sporcle

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

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.