placeholder image to represent content

Brownbag Quiz

Quiz by Matt Elliott

Feel free to use or edit a copy

includes Teacher and Student dashboards

Measure skills
from any curriculum

Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.

With a free account, teachers can

edit the questions
save a copy for later
start a class game
automatically assign follow-up activities based on students’ scores
assign as homework
share a link with colleagues
print as a bubble sheet

Q 1/10
Score 0
What is the time complexity of inserting an element at the beginning of an array?
29
O(n^2)
O(log n)
O(n)
O(1)

Our brand new solo games combine with your quiz, on the same screen

Correct quiz answers unlock more play!

New Quizalize solo game modes

10 questions

Show answers

Q1
What is the time complexity of inserting an element at the beginning of an array?
O(n^2)
O(log n)
O(n)
O(1)
30s
Q2
What is the time complexity of finding an element in a sorted array using binary search?
O(log n)
O(n log n)
O(n)
O(1)
30s
Q3
What is the time complexity of a linear search algorithm?
O(n^2)
O(log n)
O(1)
O(n)
30s
Q4
What is the time complexity of the best-case scenario for bubble sort?
O(n)
O(log n)
O(n log n)
O(n^2)
30s
Q5
What is the time complexity of the worst-case scenario for quicksort algorithm?
O(n log n)
O(log n)
O(n^2)
O(n)
30s
Q6
What is the time complexity of merging two sorted arrays into a single sorted array?
O(n)
O(n^2)
O(n log n)
O(log n)
30s
Q7
What is the time complexity of the worst-case scenario for selection sort?
O(log n)
O(n log n)
O(n^2)
O(n)
30s
Q8
What is the time complexity of a typical hash table lookup?
O(n)
O(log n)
O(n^2)
O(1)
30s
Q9
What is the time complexity of inserting a new element into a heap data structure?
O(n log n)
O(n)
O(log n)
O(1)
30s
Q10
What is the time complexity of the best-case scenario for merge sort algorithm?
O(n log n)
O(n)
O(n^2)
O(log n)
30s

Teachers give this quiz to your class