99
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Binarily Gapped Binary Insertion Sorting Technique

&

REFERENCES

  • D. E. Knuth , The Art of Computer Programming: Sorting and Searching . Vol. 3. Reading, MA: Addision-Wesley, 1973.
  • T. H. Cormen , C. Leiserson , R. L. Rivest , and C. Stein , Introduction to Algorithm . 2nd ed. PHI-EEE, Cambridge, MA: MIT Press, 2002.
  • M. A. Bender , M. F. Colton , and M. A. Mosteiro , “Insertion Sort is O(nlog n),” in Theory of Computing Systems , Vol. 39, no. 3, Secaucus, NJ: Springer-Verlag New York, Inc., 2006, pp. 391–7.
  • S. K. Ray and S. Ghosh , “Low-Cost dictionary machine using RAM-Based CAM,” in International Conference on Advanced Computing (ICAC 09) , Tiruchirappalli, 2009, pp. 559–66.
  • S. K. Ray , “Large-capacity high-throughput low-cost pipelined CAM using pipelined CTAM,” IEEE Trans. Comp. , Vol. 55, no. 5, pp. 575–87, May 2006.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.