Scholars Central

Research articlePublished 2015

Marrying inefficient sorting techniques can give birth to a substantially more efficient algorithm

Authors: Mirza Abdulla

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

The classical sorting techniques such as Selection Sort and Insertion sort have a poor worst case time performance of . However, these techniques can be useful for relatively small data sets. In this paper we look at the interesting case of applying the ideas of both techniques on a set of n elements. We show that it is possible to use both techniques together to produce a more efficient hybrid sorting algorithm. This hybrid algorithm runs in √ and therefore, improves the worst case time efficiency by a factor of √ . The asymptotic time performance of the hybrid algorithm is the same for the best, average and worst case scenarios

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in International Journal of Computer Science and Mobile Applications.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalInternational Journal of Computer Science and Mobile Applications
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Mirza Abdulla”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels