H HopQuiz.

CS: Data Structures & Big-O

15 cards · by HopQuiz · free flashcards with spaced repetition

Study this deck in HopQuiz →

Cards in this deck

  1. Big-O of array access by index — O(1)
  2. Big-O of binary search — O(log n)
  3. Big-O of linear search — O(n)
  4. Big-O of merge sort — O(n log n)
  5. Big-O of bubble sort (worst case) — O(n²)
  6. A LIFO structure — Stack
  7. A FIFO structure — Queue
  8. Key–value structure with ~O(1) lookup — Hash table (hash map)
  9. A tree where each node has at most two children — Binary tree
  10. Nodes each pointing to the next — Linked list
  11. Amortized cost of appending to a dynamic array — O(1)
  12. Searching an unsorted linked list — O(n)
  13. What "O(1)" means — constant time
  14. Graph traversal using a queue — Breadth-first search (BFS)
  15. Graph traversal using a stack / recursion — Depth-first search (DFS)

Open HopQuiz to study CS: Data Structures & Big-O with flip, multiple-choice, and type-the-answer modes, spaced repetition, and a focus timer.

Launch HopQuiz →