Improved Exponential Tree Integer Sorting Algorithm Using Node Growth

by Ajit Singh

The traditional integer sorting algorithms give a lower bound of O(n log n) expected time without randomization and O(n) with randomization. Recent researches have optimized lower bound for... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 384841595X
• ISBN13: 9783848415953
• Release Date: March 2012
• Publisher: LAP Lambert Academic Publishing
• Length: 56 Pages
• Weight: 0.21 lbs.
• Dimensions: 0.1" x 6.0" x 9.0"