tournament sort

This is a discussion on tournament sort within the C Programming forums, part of the General Programming Boards category; Hi,people. If anybody can explain how tournament sort is working?(tree) Thanks....

  1. #1
    Unregistered
    Guest

    Question tournament sort

    Hi,people.
    If anybody can explain how tournament sort is working?(tree)
    Thanks.

  2. #2
    Code Goddess Prelude's Avatar
    Join Date
    Sep 2001
    Posts
    9,796
    >If anybody can explain how tournament sort is working?
    Divide the data in half and recursively sort the two halves by dividing further and further until there are only two items, sort them, move up a level and do the same thing. This is the basic idea behind a top-down mergesort.

    -Prelude
    My best code is written with the delete key.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Straight Insertion Sort function problem
    By StaticKyle in forum C++ Programming
    Replies: 6
    Last Post: 05-12-2008, 04:03 AM
  2. threaded merge sort
    By AusTex in forum Linux Programming
    Replies: 4
    Last Post: 05-04-2005, 04:03 AM
  3. Sorting
    By vasanth in forum A Brief History of Cprogramming.com
    Replies: 12
    Last Post: 11-10-2003, 04:21 PM
  4. radix sort and radix exchange sort.
    By whatman in forum C Programming
    Replies: 1
    Last Post: 07-31-2003, 12:24 PM
  5. Shell Sort vs Heap Sort vs Quick Sort
    By mackol in forum C Programming
    Replies: 6
    Last Post: 11-22-2002, 07:05 PM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21