본문 바로가기
  • Home

Quicksort Using Range Pivot

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2012, 17(4), pp.139-145
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

Generally, Quicksort selects the pivot from leftmost, rightmost, middle, or random location in the array. This paper suggests Quicksort using middle range pivot and continually divides into 2. This method searches the minimum value and maximum value in the length of list . Then compute the initial pivot key and swaps until or . After the swap, the length of list separates in two lists and and the pivot values are selected by . This process repeated until the length of partial list is two. At the length of list is two and , swaps as . This method is simpler pivot key process than Quicksort and improved the worst-case computational complexity to .

Citation status

* References for papers published after 2022 are currently being built.