The Quicksort Game
In this thesis, we introduce a new combinatorial game called the Quicksort game. This game is played on a sequence of numbers, and players move by pivoting around a number in the manner of the familiar Quicksort algorithm. We also examine a variation on the Quicksort game called Pseudo-Quicksort. Th...
Main Author: | Chen, Andreas |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Matematik (Avd.)
2016
|
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-188170 |
Similar Items
-
A Study on Quicksort
by: Lin Ken Hung, et al.
Published: (2002) -
Quicksort algorithm again revisited
by: Charles Knessl, et al.
Published: (1999-12-01) -
HYBRID QUICKSORT: AN EMPIRICAL STUDY
by: Surya Sujarwo
Published: (2013-10-01) -
The Quicksort algorithm and related topics
by: Iliopoulos, Vasileios
Published: (2013) -
Supercomputing over Cloud using the Quicksort algorithm
by: Mattamadugu, Lakshmi Narashima Seshendra, et al.
Published: (2012)