P. Biggar, N. Nash, K. Williams, and D. Gregg, An experimental study of sorting and branch prediction, Journal of Experimental Algorithmics, vol.12, issue.1, 2008.
DOI : 10.1145/1227161.1370599

R. Gerth-stølting-brodal, G. Fagerberg, and . Moruz, On the adaptiveness of quicksort, ACM Journal of Experimental Algorithmics, vol.12, 2008.

S. Gerth, G. Brodal, and . Moruz, Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms, Algorithms and Data Structures, pp.385-395, 2005.

S. Gerth, G. Brodal, and . Moruz, Skewed Binary Search Trees, Algorithms ? ESA 2006, pp.708-719, 2006.

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms, 2009.

A. Elmasry, J. Katajainen, and M. Stenmark, Branch Mispredictions Don???t Affect Mergesort, Experimental Algorithms, pp.160-171, 2012.
DOI : 10.1007/978-3-642-30850-5_15

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

L. John, D. A. Hennessy, and . Patterson, Computer Architecture, Fifth Edition: A Quantitative Approach, 2011.

K. Kaligosi and P. Sanders, How Branch Mispredictions Affect Quicksort, Algorithms ? ESA 2006, pp.780-791, 2006.
DOI : 10.1007/11841036_69

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times, 2008.
DOI : 10.1090/mbk/058

C. Martínez, M. E. Nebel, and S. Wild, Analysis of Branch Misses in Quicksort, Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics , ANALCO 2015, pp.114-128, 2015.
DOI : 10.1137/1.9781611973761.11

S. Roura, Improved master theorems for divide-and-conquer recurrences, Journal of the ACM, vol.48, issue.2, pp.170-205, 2001.
DOI : 10.1145/375827.375837
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.5528

P. Sanders and S. Winkel, Super Scalar Sample Sort, Algorithms ? ESA, pp.784-796, 2004.
DOI : 10.1007/978-3-540-30140-0_69
URL : http://hdl.handle.net/11858/00-001M-0000-000F-2B4B-0