Unicode Searching Algorithm Using Multilevel Binary Tree Applied on Bangla Unicode

  • Md. Akhtaruzzaman
Conference paper


Unicode Searching Algorithm using multilevel binary tree is proposed to search the Unicode in efficient way. The algorithm is applied on Bangla Unicode searching to convert Bijoy string into Unicode string. Firs, the algorithm build a multilevel binary tree based on ACII code with its corresponding Unicode. The tree is build from a multilevel binary sorted data containing ASCII code and its corresponding Unicode. The data must be sorted based on ASCII code. The algorithm takes Bangla Bijoy string as input value and output the same string in Unicode format. The input Bijoy string must be in Unicode readable format


Stein Sorting 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Introduction to Algorithms (Second Edition) by. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford SteinGoogle Scholar
  2. [2]
    http://www.acm.uiuc.edu/conference/index.phpGoogle Scholar
  3. [3]
    http://www.jorendorff.com/articles/index.htmlGoogle Scholar
  4. [4]
    http://www.unicode.org/unicode/reports/tr10/tr10- 8.htmlGoogle Scholar
  5. [5]
    http://www.connect-bangladesh.org/bangla/ webbangla.htmlGoogle Scholar
  6. [6]
    http://www.betelco.com/bd/bangla/bangla.htmlGoogle Scholar

Copyright information

© Springer 2007

Authors and Affiliations

  • Md. Akhtaruzzaman
    • 1
  1. 1.Department of Computer Science and Engineering, International Islamic University Chittagong Dhaka CampusDhaka

Personalised recommendations