抽象的な

A Fusion Sorting Technique Using Multithreading Approach

Devyani Jivani, Ayushi Agrawal, Kshitij Gupte

Sorting is one of the most common operations performed by computers especially in database applications where uploading is done by sorting transactions and merging them with a master file. People prefer relevant data to be sorted before wading through various pages of data. It is ubiquitous in engineering applications in all disciplines. There is only one basic strategy of sorting but the variations are of a great number. Algorithms like bubble sort remain favorite of people especially beginners as they first strike their mind when they sort not keeping in mind the factors such as time complexity which will be discussed extensively in our paper. Here we have discussed a few sorting algorithms with their complexities and have proposed a fusion method of sorting which uses the popular bubble sort in combination with merge sort using the multi-threading approach.