Enhanced Insertion Sort by Threshold Swapping

Elshqeirat, Basima; Altarawneh, Muhyidean; Aloqaily, Ahmad

doi:10.14569/ijacsa.2020.0110659

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Basima Elshqeirat et al, presented an enhanced version of insertion sort titled Enhanced Insertion Sort (EIS) by using threshold values [22]. The authors proposed the enhanced insertion sort, especially for large data sets.…”

Section: Introductionmentioning

confidence: 99%

“…Execution Time comparison of insertion sort, Enhanced insertion sort, and insertion sort with preprocessing Execution Time comparison of existing insertion sort, enhanced insertion sort, and preprocessing insertion sort Results of table 2 and figure2prove that Enhanced Insertion Sort (EIS) which was presented in[22] takes more time than original insertion sort algorithm, however our proposed preprocessing strategy is better than the original insertion sort as well as Enhanced Insertion Sort in terms of execution time. Execution Time comparison of existing quicksort with preprocessing quicksort…”

mentioning

confidence: 99%

See 1 more Smart Citation

Preprocessing: A method For Reducing Time Complexity

Mubarak

Iqbal

Rasool

et al. 2022

JCBI

View full text Add to dashboard Cite

Data can be processed quickly if it is in some order, whereas unsequenced data can take more time to obtain results. Sorting is used for data arrangement. It is also one of the essential requirement for most applications and this step helps to boost performance. Sorting is also a prerequisite in several computer applications like databases. Over time computer scientists have not only introduced new sorting techniques considering various factors to be improved but they have also presented enhanced variants of existing sorting methods. The main objective has always been to reduce the execution time and space of the sorting algorithms. With every passing day, digital content is growing rapidly, which is a significant cause that encourages researchers to design new time-space efficient sorting algorithms. This paper presents some preprocessing strategies for quicksort and insertion sort to improve their performances. Tha main idea of using these preprocessings is to make input data more suitable for sorting algorithm, as most sorting function performs extraordinary for a specific type of input, such as insertion sort works better on nearyly sorted data. To authenticate the efficiency of existing sorting algorithms, these have been compared with proposed preprocessing strategies. The results with proposed techniqes outperforms the results of original sorting methods. It also helps to convert worst case into average case. By using this approch complexity of many algorithms can be reduced, therfore this is very important.

show abstract

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%