doi: 10.7763/IJCTE.2012.V4.575
Interpolation Sort and Its Implementation with Strings
Gourav Saha
,
- Madras Institute of Technology, Anna University, India.
Abstract
In this paper we propose a new array sorting algorithm with average and best time complexity of O(n). Its best, worst and average time complexity has been analysed. Also the difficulty of applying this algorithm with strings has been discussed and its solution too is found. The limitation of the solution is also analysed.
Keywords
- Sorting algorithm
- interpolation
- sub-arrays
- time complexity
- strings
How to Cite
Gourav Saha and S. Selvam Raju, "Interpolation Sort and Its Implementation with Strings," International Journal of Computer Theory and Engineering, vol. 4, no. 5, pp. 772-776, 2012. https://doi.org/10.7763/IJCTE.2012.V4.575
Copyright & License
Copyright © 2012 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).