Card 1
Term
Dijkstra's Algorithm
Definition
Shortest path in a graph
Card 2
Term
Merge Sort
Definition
Divide and conquer sorting
Card 3
Term
Searching
Definition
Finding an element in data
Card 4
Term
Binary Search
Definition
Efficient search in sorted array
Card 5
Term
Sorting
Definition
Arranging data in order
Card 6
Term
Dynamic Programming
Definition
Solving problems by breaking into subproblems
Card 7
Term
Greedy Algorithm
Definition
Making locally optimal choices
Card 8
Term
Backtracking
Definition
Trying all possibilities recursively
Card 9
Term
Quick Sort
Definition
Efficient sorting algorithm
Card 10
Term
Depth-First Search
Definition
Graph traversal using stack
Card 11
Term
Breadth-First Search
Definition
Graph traversal algorithm
Card 12
Term
Divide and Conquer
Definition
Breaking problem into smaller parts
Card 13
Term
Big O Notation
Definition
Describes algorithm efficiency
Card 14
Term
Recursion
Definition
Function calling itself
Card 15
Term
Hashing
Definition
Mapping data to fixed-size values