Comb Sort

Comb Sort

Edited by 

List price: US$47.99

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Comb sort is a relatively simplistic sorting algorithm originally designed by Wlodzimierz Dobosiewicz in 1980. Later it was rediscovered and popularized by Stephen Lacey and Richard Box with a Byte Magazine article published in April 1991. Comb sort improves on bubble sort, and rivals algorithms like Quicksort. The basic idea is to eliminate turtles, or small values near the end of the list, since in a bubble sort these slow the sorting down tremendously. In bubble sort, when any two elements are compared, they always have a gap of 1. The basic idea of comb sort is that the gap can be much more than one.show more

Product details

  • Paperback | 96 pages
  • 152 x 229 x 6mm | 150g
  • Bellum Publishing
  • United States
  • English
  • 6135824112
  • 9786135824117