Home
Algorithms
Bit Manipulation
Dynamic Programming
Euclid
Fourier Transform
Graph
A*
Breadth-first Search
Depth First
Dijkstra
Problems
Hash
K-nearest Neighbor
Linear Programming
Naive Bayes classifier
NP-Complete Algorithms
Probability
Random
Recursion
Search
Binary Search
Simple Search
Sort
Merge Sort
Quick Sort
Selection Sort
Substring
Time Complexity
Data Stores
Hive
Kafka
Spanner
Data Structures
Hash Tables
Inverted Index
Probabilistic
Stack
Trees
Binary Search Tree
Heap
Red-Black Tree
Splay Tree
Tree Construction
Trie
Languages
Markdown
SQL
Other
CAP Theorem
Code Quality
ETL
Operating Systems
System Design
Testing
Tools
PGP
Edit
Home
>
Algorithms
>
Search
> Simple Search
Simple search
Simple Search
Simple search
go one at a time through an array
O(n)