English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Sorting has been a profound area for the algorithmic researchers and manyresources are invested to suggest more works for sorting algorithms. For thispurpose, many existing sorting algorithms were observed in terms of theefficiency of the algorithmic complexity. In this paper we implemented thebubble and merge sort algorithms using Message Passing Interface (MPI)approach. The proposed work tested on two standard datasets (text file) withdifferent size. The main idea of the proposed algorithm is distributing theelements of the input datasets into many additional temporary sub-arraysaccording to a number of characters in each word. The sizes of each of thesesub-arrays are decided depending on a number of elements with the same numberof characters in the input array. We implemented MPI using Intel core i7-3610QM,(8 CPUs),using two approaches (vectors of string and array 3D) . Finally, weget the data structure effects on the performance of the algorithm for that wechoice the second approach.

Parallelize Bubble and Merge Sort Algorithms Using Message Passing Interface (MPI)