3-Points Average Pivot Quicksort
Sang-Un Lee · 한국인터넷방송통신학회 논문지 · 2014
Abstract In the absence of a sorting algorithm faster than , Quicksort remains the best and fastest of its kind in practice. For given data, Quicksort records running in at best and at its worst. In this paper, I propose an algorithm by which 3-points average is set as a pivot for first array , last array , and middle array ⌊⌋in order to find the more fast than Quicksort. Test results prove that the proposed 3-points average pivot Quicksort has the time complexity of at its best, average, and worst cases. And the proposed algorithm can be reduce the time of Quicksort to . Key Words : Quicksort, Pivot, Leftmost, Rightmost, Median, Random * 정회원, 강릉원주대학교 과학기술대학 멀티미디어공학과접수일자 : 2014년 7월 13일, 수정완료 : 2014년 11월 2일게재확정일자 : 2014년 12월 12일Received: 13 July, 2014 / Revised: 2 November, 2014 /Accepted: 12 December, 2014 * Corresponding Author: [email protected]. of Multimedia Eng., Gangneung-Wonju National University, Korea