---
id: 698dc8ae7932b3cc4b19c925
title: Determining Complexity 
challengeType: 11
videoId: 8bglWlQYTPQ
dashedName: determining-complexity
---

# --description--

In this video, you will learn how to determine the worst case complexity for an algorithm.

# --questions--

## --text--

What is the worst case runtime for binary search?

## --answers--

`O(n)`

---

`O(log n)`

---

`O(1)`

---

`O(n log n)`

## --video-solution--

2