Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
100 views5 pages

Program1 PP

The document provides a step-by-step guide to create an OpenMP program for sorting an array using both sequential and parallel mergesort. It includes code for merging, filling, and sorting the array, along with timing the execution of both methods. The final output displays the execution time for both the sequential and parallel mergesort implementations.

Uploaded by

tejuharshapatil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
100 views5 pages

Program1 PP

The document provides a step-by-step guide to create an OpenMP program for sorting an array using both sequential and parallel mergesort. It includes code for merging, filling, and sorting the array, along with timing the execution of both methods. The final output displays the execution time for both the sequential and parallel mergesort implementations.

Uploaded by

tejuharshapatil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Write a OpenMP program to sort an array on n elements using both sequential and parallel

mergesort(using Section). Record the difference in execution time.

STEP1

Open Dev C++

STEP2

Click on File----Project----Select Console----OpenMP

Select Project as C++ and press OK

STEP3

After Project is created under project create set.cpp file and type code as in below
#include <stdio.h>

#include <stdlib.h>

#include <omp.h>

#include <time.h>

#define SIZE 100000 // You can change this to test with larger arrays

void merge(int arr[], int l, int m, int r) {

int i, j, k;

int n1 = m - l + 1;

int n2 = r - m;

int *L = (int *)malloc(n1 * sizeof(int));

int *R = (int *)malloc(n2 * sizeof(int));

for (i = 0; i < n1; i++) L[i] = arr[l + i];

for (j = 0; j < n2; j++) R[j] = arr[m + 1 + j];

i = 0; j = 0; k = l;

while (i < n1 && j < n2)

arr[k++] = (L[i] <= R[j]) ? L[i++] : R[j++];

while (i < n1) arr[k++] = L[i++];

while (j < n2) arr[k++] = R[j++];

free(L);

free(R);

void mergeSortSeq(int arr[], int l, int r) {

if (l < r) {
int m = (l + r) / 2;

mergeSortSeq(arr, l, m);

mergeSortSeq(arr, m + 1, r);

merge(arr, l, m, r);

void mergeSortParallel(int arr[], int l, int r) {

if (r - l < SIZE){

mergeSortSeq(arr, l, r); // Use sequential for small problems

} else if (l < r) {

int m = (l + r) / 2;

#pragma omp parallel sections

#pragma omp section

mergeSortParallel(arr, l, m);

#pragma omp section

mergeSortParallel(arr, m + 1, r);

merge(arr, l, m, r);

void fillArray(int arr[], int size) {

for (int i = 0; i < size; i++)

arr[i] = rand() % 100000;

void copyArray(int src[], int dest[], int size) {

for (int i = 0; i < size; i++)


dest[i] = src[i];

int main() {

int *a1 = (int *)malloc(SIZE * sizeof(int));

int *a2 = (int *)malloc(SIZE * sizeof(int));

double start, end;

fillArray(a1, SIZE);

copyArray(a1, a2, SIZE);

// Sequential Merge Sort

start = omp_get_wtime();

mergeSortSeq(a1, 0, SIZE - 1);

end = omp_get_wtime();

printf("Sequential Merge Sort Time: %.6f seconds\n", end - start);

// Parallel Merge Sort

start = omp_get_wtime();

mergeSortParallel(a2, 0, SIZE - 1);

end = omp_get_wtime();

printf("Parallel Merge Sort Time: %.6f seconds\n", end - start);

free(a1);

free(a2);

return 0;

Final Step Goto Execute Menu and click on Compile and Run You can see the Time elapse of parallel
functional is less compared to sequential for tunning Merge sort pseudo code

You might also like