Algorithms
The basics of reading and analyzing algorithms. A starter deck to adapt to your course and level.
Study this deckCramDesk · Free
My cards
6/40- 01
What is an algorithm?
- 02
What condition is required for binary search?
- 03
What is the time complexity of binary search?
- 04
What order does a stack use?
- 05
What is a variable for?
- 06
What does a loop do?
Cards stay in this browser. Export the file to keep or transfer them.
Active recall session
Start studying
Start studying
Already have a PDF full of answers?
CramDesk can turn your course PDF into flashcards automatically.
Explore flashcards from a PDFQuestions in this deck
01What is an algorithm?
A finite sequence of precise instructions for solving a problem.
02What condition is required for binary search?
The elements must be sorted in a known order.
03What is the time complexity of binary search?
O(log n) in a sorted, indexable collection.
04What order does a stack use?
Last in, first out (LIFO).
05What is a variable for?
It associates a name with a value that can be read and possibly changed.
06What does a loop do?
It repeats instructions according to a condition or iteration count.