Binary search

About the algorithm:

Splits sorted data set in half until target is (not) found

Categories:  Search   Inefficient  

---

Best case: Ω(1)

---

Worst case: O(log n)

---

Try the algorithm:

• Load csv file
• Input your own array (syntax: comma sepparated values, e.g. 1, 2, 3, 4, 5)
• Generate random array (syntax: start, end, number of entries, e.g. -5, 5, 7)

Submit