EWU Institutional Repository

A New Sorting Algorithm Based on Interpolation Merging and It’s Parallel Implementation

Show simple item record

dc.contributor.author Das, Tarun
dc.date.accessioned 2017-03-20T05:11:24Z
dc.date.available 2017-03-20T05:11:24Z
dc.date.issued 1/22/2016
dc.identifier.uri http://dspace.ewubd.edu/handle/2525/2114
dc.description This thesis submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering of East West University, Dhaka, Bangladesh en_US
dc.description.abstract We present a new modified merge sort algorithm (invented by John von Newmann in 1945) based on interpolation merging technique. Known to date, simple binary merging is the best general purpose merging algorithm. However, interpolation merging requires substantially fewer comparisons and increases the performance of modified merge sort algorithm. Results from a computer implementation of the new sorting algorithm is given and compared with merge sort implementation based on tape merging and binary merging algorithms. In addition, the parallel version of the proposed algorithm is implemented with openMP and pthreads frameworks. en_US
dc.language.iso en_US en_US
dc.publisher East West University en_US
dc.relation.ispartofseries ;CSE00088
dc.subject A New Sorting Algorithm Based on Interpolation Merging en_US
dc.title A New Sorting Algorithm Based on Interpolation Merging and It’s Parallel Implementation en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account