Abstract

Rapid information search in large data sets is one of the most important issues. Quite often it leads sorting strings stored in different cultures, languages. In this work the author presents a modified triple heap algorithm to sort strings for large data sets. Triple heap algorithm is the subject of research and demonstrating its usefulness in applications.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call