/TimeComplexityProject

Measure time complexity of popular searching and sorting algorithms

Primary LanguageC#

Time Complexity Project

This repository is a C# project showcasing popular searching and sorting algorithms and their time complexities.

Algorithm Best Case ($\Omega$) Average Case ($\Theta$) Worst Case ($O$)
Linear Search $\Omega(1)$ $\Theta(n)$ $O(n)$
Binary Search $\Omega(1)$ $\Theta(\log(n))$ $O(\log(n))$
Selection Sort $\Omega(n^2)$ $\Theta(n^2)$ $O(n^2)$
Quick Sort $\Omega(n\log(n))$ $\Theta(n\log(n))$ $O(n^2)$