User:Jmallios

From Wikipedia, the free encyclopedia

20021113 - Submitted on FvdP's talk page by Jmallios in response to FvdP's question of the use of Omega notation on the Bubble Sort page: I prefer the use of Omega notation over Theta when talking about the best case scenario (i.e. lower bound) of a function or algorithm. By using Omega(n) instead of Theta(n) as the complexity of sorting an already-sorted list (which is the best possible case for a list with more than 0 elements), the reader can infer that the algorithm will perform absolutely no less efficiently than (n). Theta only implies that there is an upper AND lower bound, but does not necessarily define either. Therefore, Theta is best used in the "average" case. Notice I thought Theta was appropriate when defining the general performance of Bubble Sort. Thanks, Jason Mallios, Austin, Texas