Improved Selection Sort Algorithm

Abstract

One of the basic problems of Computer Science is sorting a list of items. It refers to the arrangement of numerical or alphabetical or character data in statistical order. Bubble, Insertion, Selection, Merge, and Quick sort are most common ones and they all have different performances based on the size of the list to be sorted. As the size of a list increases, some of the sorting algorithm turns to perform better than others and most cases programmers select algorithms that perform well even as the size of the input data increases. As the size of dataset increases, there is always the chance of duplication or some form of redundancies occurring in the list. For example, list of ages of students on a university campus is likely to have majority of them repeating. A new algorithm is proposed which can perform sorting faster than most sorting algorithms in such cases. The improved selection sort algorithm is a modification of the existing selection sort, but here the number of passes needed to sort the list is not solely based on the size of the list, but the number of distinct values in the dataset. This offers a far better performance as compared with the old selection sort in the case where there are redundancies in the list.

Modified Selection Sort Algorithm Employing Boolean and Distinct Function in a Bidirectional Enhanced Selection Technique

“…The concept presented in a study of [10] utilizes a queue to store the locations of all values that are the same as the maximum value. This idea is only useful if the given unsorted list is with duplications.…”

“…To illustrate the proposed enhancement, for example, the list 7,15,5,11,50,10,98,67,80,19, 30 is to be sorted. In this list, the maximum is 98, and it will be interchanged with the last value of the list, which is 30.…”

Sistem Za Personalizaciju Video Tutorijala Zasnovan Na Mašinskom Učenju

“…Prilikom gledanja ovog tutorijala studentu se prati pogled na ekranu. Nakon odgledanog tutorijala, student gleda još dva tutorijala u vezi dva algoritma sortiranja: Bubble sort [10] i Selection sort [11]. Za svaki algoritam postoje četiri kombinacije (sa tutorom sa prevodom, bez tutora (animacija) sa prevodom, sa tutorom bez prevoda, bez tutora bez prevoda).…”

Hybrid Bubble and Merge Sort Algorithms Using Message Passing Interface

“…(1, 3, and 4) or descending one e.g. (3,2, and 1). The input is a sequence of N items, which are in some random order; at the end of output are sorting or arranging elements of list in specific way either a positive or negative order [1].…”

“…Sorting is considered as a fundamental problem-solving method for computer scientists and as an intermediate step to solve other problems. Many sorting algorithms are used in the field of computer science; they differ in their complexity (execution time and space), utilization with different data type, and resource usage [2]. In this paper we focus on the bubble sort algorithm.…”