Wednesday 24th of April 2024
 

Parallel Implementation of Sorting Algorithms


Malika Dawra and Priti

A sorting algorithm is an efficient algorithm, which perform an important task that puts elements of a list in a certain order or arrange a collection of elements into a particular order. Sorting problem has attracted a great deal of research because efficient sorting is important to optimize the use of other algorithms such as binary search. This paper presents a new algorithm that will split large array in sub parts and then all sub parts are processed in parallel using existing sorting algorithms and finally outcome would be merged. To process sub parts in parallel multithreading has been introduced

Keywords: sorting, algorithm, splitting, merging, multithreading.

Download Full-Text


ABOUT THE AUTHORS

Malika Dawra
doing m.tech in computer science and application from MDU uvinersity rohtak

Priti
doing job as Asstt.professor( department of computer science and application) MDU uninersity rohtak


IJCSI Published Papers Indexed By:

 

 

 

 
+++
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »