Engineering quicksort

Sarwar, Syed Mansoor; Sarwar, Syed Aqeel; Jaragh, M.; Brandeburg, Jesse

doi:10.1016/0096-0551(96)00005-7

Cited by 12 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sarwar et al 16 once conducted extensive experiments on quicksort and tried various methods for selecting a pivot (from 1, 3, 5, 9, and 17 elements). They concluded that quicksort performs best when the pivot is the median of three elements and there is no need to call insertion sort.…”

Section: Select Best Quicksortmentioning

confidence: 99%

Sort race

2022

View full text Add to dashboard Cite

Sorting is one of the oldest computing problems and is still very important in the age of big data. Numerous algorithms and implementation techniques have been proposed. In this study, we focus on comparison based, internal sorting algorithms. We created 12 types of data of various sizes for experiments and tested extensively various implementations in a single setting. Using some effective techniques, we found that quicksort is adaptive to nearly sorted inputs and is still the best overall sorting algorithm. We also identified techniques that are effective in timsort, which is one of the most popular and efficient sorting methods based on natural mergesort. In addition, we created a version of our own mergesort, which performs better than timsort on nearly sorted instances. Our implementations of quicksort and mergesort are different from other implementations reported in all textbooks or research articles, and are faster than any version of the C library qsort functions not only for randomly generated data, but also for various types of nearly sorted data. This work can aid the user to choose the best sorting algorithm for the hard sorting job at hand, and provides a platform for anyone to test their own sorting algorithm against the best in the field.

show abstract

Section: Select Best Quicksortmentioning

confidence: 99%

Sort race

2022

View full text Add to dashboard Cite

show abstract

“…Our work is the first step to evaluate the optimize value of operating system parameter in minimum time. It also enlists the operating system parameters that affect the following components of operating system [9].…”

Section: T(p) = C +Tp(instance)mentioning

confidence: 99%

Runtime Customization of Swap Partition to Improve the Performance of a Number Crunching Algorithm

Raghuvanshi¹,

Verma²,

Sharma³

2013

IJCA

View full text Add to dashboard Cite

This paper focuses on the enhancement of the practical performance of an algorithm and data structures. It provides a way to achieve the effect on performance parameters of operating system. The proposed work has been done about the performance of a number crunching program (Matrix Multiplication) by varying the swap area at run time. We feed a C program as input to the system that executes it for different value of swap area and records the performance parameters as real time, system time, CPU utilization, page faults occurs during execution, context switching due to time slice and context switching due to input output etc. It also presents the way of enhancement in performance of program by customizing the swap partition of operating system.

show abstract

Transcription and Distillation of Spontaneous Speech

Furui

Kawahara

2008

Springer Handbook of Speech Processing

View full text Add to dashboard Cite

Engineering quicksort

Cited by 12 publications

References 7 publications

Sort race

Sort race

Runtime Customization of Swap Partition to Improve the Performance of a Number Crunching Algorithm

Transcription and Distillation of Spontaneous Speech

Contact Info

Product

Resources

About