A-Level Computer Science — Algorithms — Sorting, Searching and Complexity
15 flashcards covering Algorithms — Sorting, Searching and Complexity. Designed for A-Level Computer Science revision using spaced repetition.
15 cards in this deck
This free A-Level Computer Science deck covers A-Level Computer Science — Algorithms — Sorting, Searching and Complexity. Every question in the deck is listed below — sign in free to flip each card, reveal the answer, and rate your confidence so spaced repetition can schedule your reviews for you.
All 15 questions in this deck
- What is Bubble Sort
- Time complexity of Linear Search
- What is Binary Search
- Big O notation
- What is Merge Sort
- Quick Sort average time complexity
- What is a stable sort
- Time complexity of Quick Sort
- What is Selection Sort
- Space complexity of Bubble Sort
- What is Insertion Sort
- Time complexity of Merge Sort
- What is a recursive algorithm
- Space complexity of Merge Sort
- What is the trade-off between time and space complexity
Sign in free to see the answers and study this deck with spaced repetition.
See all 15 cards and track your progress — free
More A-Level Computer Science decks
- A-Level Computer Science — Computer Organisation — Processor Architecture15 cards
- A-Level Computer Science — Computational Thinking — Abstraction and Decomposition15 cards
- A-Level Computer Science — Data Structures — Trees, Graphs and Hash Tables15 cards
- A-Level Computer Science — Object-Oriented Programming — Classes and Inheritance15 cards
Frequently asked questions
How many flashcards are in A-Level Computer Science — Algorithms — Sorting, Searching and Complexity?
This deck contains 15 flashcards, each with a question on the front and the answer on the back. All the questions are listed on this page — create a free account to flip the cards and see the answers.
Is this A-Level Computer Science deck free to study?
Yes — every deck in the Nextutor library is free. Sign in with a free account to study the full deck, rate your confidence on each card, and track your progress over time.
How does spaced repetition work on Nextutor?
After you flip each card you rate it Hard, OK or Easy. Cards you find hard come back the next day, OK cards in about three days, and easy cards after a week or more — so your revision time goes to the A-Level Computer Science cards you're closest to forgetting.
Get personalised help with A-Level Computer Science — Algorithms — Sorting, Searching and Complexity. Book a A-Level Computer Science tutor →