Encyclopedia > Best-case performance

  Article Content

Best-case performance

The term best-case performance is used in computer science to describe the way an algorithm behaves under optimal conditions. For example, a simple linear search on an array has a worst case performance O(n), when the algorithm has to check every element, and average running time is O(n/2) (see Big O notation), when the item to be found is around the middle of an array, but in best-case running time, the first element that the linear search looks at is the element the algorithm was searching for, and best-case running time is O(1).

It is not practical to base algorithm analysis solely on best-case performance, because most academic and professional industries are more interested in improving worst-case performance and average performance scenarios, as they occur more often than best-case scenarios.

All Wikipedia text is available under the terms of the GNU Free Documentation License

  Search Encyclopedia

Search over one million articles, find something about almost anything!
  Featured Article

... - 19th century Decades: 1750s 1760s 1770s 1780s 1790s - 1800s - 1810s 1820s 1830s 1840s 1850s Years: 1795 1796 1797 1798 1799 - 1800 - 1801 1802 1803 1804 ...