> For the complete documentation index, see [llms.txt](https://dheepakg.gitbook.io/untitled/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://dheepakg.gitbook.io/untitled/use-headings-to-create-page-groups-like-this-one/0.-about/1.-big-o-notation.md).

# Chapter 1

* A notation that tells us how fast an algortihm is.
* It's a measures the fastness of algorithm in terms of operations (not in seconds).
* Big O denotes worst case run time.

Big O notation: O(n) -> Here *n* stands for the number of operations.

## Example

| Notation   | Example                   |
| ---------- | ------------------------- |
| O(log n)   | Binary Search             |
| O(n)       | Simple search             |
| O(n.log n) | Quick Sort                |
| O(n2)      | Selection sort            |
| O(n!)      | The traveling salesperson |