like bubble sort works in n2 but in all ready sorted data it can done in order of n where n is size of list to be processed
In some cases the organization of the data set helps. Look here: https://www.researchgate.net/publication/5606737_A_finite-element_mesh_generator_based_on_growing_neural_networks
Article A finite-element mesh generator based on growing neural networks
Hi,
in worst case, the best sorting algorithms are of order n log2 n. According to Press et al. (2007), two of the best algorithms are Quicksort and Heapsort. Both are of order n log2 n even for the best case. Quicksort is of order n2 for the worst case.
References:
W. H. Press, S. A. Teukolsky, W. T. Vetterling, B. P. Flannery. Numerical Recipes: The Art of Scientific Computing, 3rd ed., Cambridge University Press, 2007
D. E. Knuth. The Art of Computer Programming, vol 3, 2nd ed., Addison-Wesley, Reading, 1998
Mergesort is also very nice and simple:
https://de.wikipedia.org/wiki/Mergesort
and O(N logN)
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Bioinformatics
- Bioinformatic Tools