- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets ♣
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Data Structures / Arrays, Sets »
An array is a list of items. Sets are unordered lists with no duplicate items. Linear searching in arrays requires N steps. The binary search in ordered arrays requires logN steps.
What is an array? How are sets different from arrays? How many steps are required to search in an array? What is the algorithm for searching ordered arrays?
Click to Flip Card