Литература

1. 
   Appel, A.W. and Jacobson, G.J. The World's Fastest
   Scrabble Program. Communications of the ACM 31, 5(May
   1988), 572-578.
   
2. 
   Bentley, J.L. and McIlroy, M.D. Engineering A Sort
   function. Software-Practice and Experience 23, 1(1993),
   1249-1265
   
3. 
   Bently, J.L, McIlroy, M.D., and Knuth, D.E.
   Programming Pearls: A Literate Program. Communications of the ACM
   29, 6 (June 1986), 471-483.
   
4. 
   Bently, J.L, and Saxe, J.B. Algorithms on Vector
   Sets. SIGACT News 11, 9 (Fall 1979), 36-39.
   
5. 
   Clampett, H.A. Jr. Randomized Binary Searching with
   Tree Structures. Communications of the ACM 7, 2 (March 1964),
   163-165.
   
6. 
   "http://www.amazon.com/exec/obidos/ISBN=013215871X/pavelndubner">
   Dijkstra, E.W. A Discipline of Programming. Prentice-Hall,
   Englewood Cliffs, NJ, 1976.
   
7. 
   Flajolet, P. and Puech, C. Partial Matching
   Retrieval of Multidimensional Data. Journal of the ACM 33, 2
   (1986), 371-407.
   
8. 
   Floyd, R.W. and Rivest, R.L. Expected Time Bounds
   for Selection. Communications of the ACM 18, 3 (March 1975),
   165-172.
   
9. 
   Hoare, C.A.R. Quicksort. Computer Journal 5,
   1(April 1962), 10-15.
   
10. 
    "http://www.amazon.com/exec/obidos/ISBN=0131103709/pavelndubner">
    Kernigan, B.W. and Ritchie, D.M. The C Programming Language, Second
    Edition, Prentice-Hall, Englewood Cliffs, NJ, 1988.
    
11. 
    "http://www.amazon.com/exec/obidos/ISBN=0201896850/pavelndubner">Knuth,
    D.E. The Art of Computer Programming, volume 3: Sorting and
    Searching. Addison-Wesley, Reading, MA, 1997.
    
12. 
    Linderman, J.P. Theory and Practice in the
    Construction of a Working Sort Routine. Bell System Technical
    Journal 63, 8 (October 1984), 1827-1843.
    
13. 
    Manber, U. and Baeza-Yates, R. An Algorithm for
    String Matching with a Sequence of Don't Cares. Information
    Processing Letters 37, 3(February 1991), 133-136.
    
14. 
    Manber, U. and Myers, G. Suffix Arrays: A New Method
    for On-Line String Search. SIAM Journal on Computing 22 (1993),
    935-948.
    
15. 
    McIlroy, P.M., Bostic, K.M and McIlroy, M.D.
    Engineering Radix Sort. Computing Systems 6, 1 (1993),
    5-27
    
16. 
    Mehlhom, K. Data Structures and Algorithms 1:
    String and Searching. Springer-Verlag, Berlin, 1984.
    
17. 
    Mehlhom, K. Dynamic Binary Search. SIAM Journal
    on Computing 6, 2 (May 1979), 175-198.
    
18. 
    Munro, J.I. and Raman, V. Sorting Multisets and
    Vectors In-Place. Proceedings of the Second Workshop on Algorithms
    and Data Structures, Springer Verlag Lecture Notes in Computer Science
    519 (1991), 473-480.
    
19. 
    Rivest, R.L. Partial-Match Retrieval Algorithms.
    SIAM Journal On Computing 5, 1 (1976), 19-50.
    
20. 
    Schoenhage, A.M., Paterson, M., and Pippenger, N.
    Finding the Median. Journal of Computer and System Sciences 13
    (1976), 184-199.
    
21. 
    Sedgewick, R. Implementing Quicksort Programs.
    Communications of the ACM 21, 10 (October 1978), 847-857.
    
22. 
    Sedgewick, R. Quicksort With Equal Keys. SIAM J.
    Comp 6, 2(June 1977), 240-267.
    
23. 
    Sedgewick, R. The Analysis of Quicksort Programs.
    Acta Informatica 7 (1977), 327-355.
    
24. 
    Sleator, D.D. and Tarjan, R.E. Self-Adjusting Binary
    Search Trees. Journal of the ACM 32, 3 (July 1985),
    652-686.
    
25. 
    Vaishnavi, V.K. Multidimensional Height-Balanced
    Trees. IEEE Transactions on Computers C-33, 4 (April 1984),
    334-343.
    
26. 
    Van Emden, M.H. Increasing the Efficiency of
    Quicksort. Communications of the ACM 13, 9 (September 1970),
    563-567.
    
27. 
    Wegner, L.M. Quicksort for Equal Keys. IEEE
    Transactions on Computers C-34, 4 (April 1985), 362-367.