%0 Journal Article %1 814657 %A JaJa, J. %D 2000 %J Computing in Science Engineering %K seminar sorting ss2011 %N 1 %P 43 -49 %R 10.1109/5992.814657 %T A perspective on Quicksort %U http://ieeexplore.ieee.org/search/freesrchabstract.jsp?reload=true&tp=&arnumber=814657&queryText%3Dquicksort%26openedRefinements%3D*%26searchField%3DSearch+All %V 2 %X This article introduces the basic Quicksort algorithm and gives a flavor of the richness of its complexity analysis. The author also provides a glimpse of some of its generalizations to parallel algorithms and computational geometry

@article{814657, abstract = {This article introduces the basic Quicksort algorithm and gives a flavor of the richness of its complexity analysis. The author also provides a glimpse of some of its generalizations to parallel algorithms and computational geometry}, added-at = {2011-05-18T12:21:40.000+0200}, author = {JaJa, J.}, biburl = {https://www.bibsonomy.org/bibtex/21737d5d787a718d6984dc2e3f48df74f/qhmb}, description = {IEEE Xplore - Abstract Page}, doi = {10.1109/5992.814657}, interhash = {6d4a2bff98e8d848d562478b84811ca2}, intrahash = {1737d5d787a718d6984dc2e3f48df74f}, issn = {0740-7475}, journal = {Computing in Science Engineering}, keywords = {seminar sorting ss2011}, month = {jan/feb}, number = 1, pages = {43 -49}, timestamp = {2011-05-18T12:21:40.000+0200}, title = {A perspective on Quicksort}, url = {http://ieeexplore.ieee.org/search/freesrchabstract.jsp?reload=true&tp=&arnumber=814657&queryText%3Dquicksort%26openedRefinements%3D*%26searchField%3DSearch+All}, volume = 2, year = 2000 }