Data Structures and Algorithms


Asymmetric Quicksort

Authors: Leorge Takeuchi

Quicksort, invented by Tony Hoare in 1959, is one of the fastest sorting algorithms. However, conventional implementations have some weak points, including the following: swaps to exchange two elements are redundant, deep recursive calls may encounter stack overflow, and the case of repeated many elements in input data is a well- known issue. This paper improves quicksort to make it more secure and faster using new or known ideas in C language.

Comments: 18 Pages. Some explanation was added.

Download: PDF

Submission history

[v1] 2016-08-09 15:04:41
[v2] 2016-08-11 23:42:15
[v3] 2017-12-15 10:49:02

Unique-IP document downloads: 83 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus