ACM Logo





Invitation
  • Comment
  • Submit an Article
  • Subscribe
  • Unsubscribe
  • Forums


    Archives
  • Interviews
  • Views
  • Book Reviews
  • Book Excerpts
    •
    Ubiquity - The ACM IT Magazine and Forum




    RKPianGraphSort: A Graph Based Sorting Algorith

    Professor Rajat K. Pal




    Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. Professor Rajat K. Pal of the University of Calcutta's Department of Computer Science and Engineering proposes a graph based comparison sorting algorithm, designated as RKPianGraphSort, that takes time θ(n 2) in the worst-case, where n is the number of records in the given list to be sorted. An interesting article.

    Click Here to View Full Article


    Source: Ubiquity Volume 8 Issue 41
    (October 16, 2007 - October 22, 2007)




    Forum

    Printer Friendly Version





    [Home]   [About Ubiquity]   [The Editors]  

    Ubiquity welcomes the submissions of articles from everyone interested in the future of information technology. Everything published in Ubiquity is copyrighted ©2007 by the ACM and the individual authors.