Sorting By Element Position Count

Résumé

The concept of sorting was introduced in 1880, but the study of research on sorting has started in the year 1950 which is cited as arranging data in a particular format. Rapid growth of information and data in our world leads to augment the development of sort algorithms. The facet which attracted a great deal of research, is developing sort algorithms through improved performance and decreased complexity. Sorting algorithm specifies the way to arrange data in ascending or descending order. Sorting is also used to represent data in more readable formats. Numerous sorting methods were developed but still there is a scope for sorting in research because no one method is suitable for all the applications. In this paper a novel method to sort given list of elements is presented. In this sorting, each element position count is calculated and based on this count value elements are arranged in order. The advantage of this method is easy count the position and swap operation are not required.

Citer ce document

Accès au document

Ce lien n'est plus accessible actuellement. Contactez l'institution d'origine.

Auteur(s)

Statistiques

Consultations : 3

Téléchargements : 0