This repository has been archived by the owner on Jan 31, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
threadSort.c
131 lines (96 loc) · 2.01 KB
/
threadSort.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include <stdio.h>
#include <pthread.h>
#include <sys/time.h>
#include <stdlib.h>
#include <time.h>
#define SIZE 1000000
#define MINSIZE 1000
typedef struct
{
int* arr;
int l, r;
} sortArgs;
void sort(int* arr, int l, int r);
void mergeArray(int* arr, int l, int m, int r);
void* thread_sort(void* args);
void swap(int* a, int* b);
pthread_t tid[SIZE];
int t = 0;
int main()
{
int *a = calloc(SIZE, sizeof(int)); //initialize array
srand(time(NULL)); //initialize random generator
clock_t t1, t2;
for(int i = 0; i < SIZE; i++)
a[i] = rand() % 500; //fill array with random numbers
t1 = clock();
sort(a, 0, SIZE - 1); //start sorting with threads
t2 = clock();
printf ("Total time = %f seconds\n", (double) (t2 - t1) / CLOCKS_PER_SEC);
//difference is 0.07 sec
exit(0);
}
void sort(int* arr, int l, int r)
{
int middle = (l + r) / 2;
if(r == l) return;
if(r - l == 1)
{
if(arr[l] > arr[r]) swap(&arr[l], &arr[r]);
}
else if(r - l <= MINSIZE) //if there is less than MINSIZE elements
// better to use manual version over threads
{
sort(arr, l, middle);
sort(arr, middle + 1, r);
mergeArray(arr, l, middle, r);
}
else
{
sortArgs args;
args.l = l;
args.r = r;
args.arr = arr;
pthread_create(&tid[t], NULL, thread_sort, (void*) &args);
pthread_join(tid[t++], NULL);
}
}
void mergeArray(int* arr, int l, int m, int r)
{
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (int i = 0; i < n1; i++)
L[i] = arr[l + i];
for (int j = 0; j < n2; j++)
R[j] = arr[m + 1+ j];
int i, j;
i = j = 0;
int k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
arr[k++] = L[i++];
else
arr[k++] = R[j++];
}
while (i < n1)
arr[k++] = L[i++];
while (j < n2)
arr[k++] = R[j++];
}
void* thread_sort(void* arg)
{
sortArgs* t = (sortArgs*)(arg);
int middle = (t->l + t->r) / 2;
sort(t->arr, t->l, middle);
sort(t->arr, middle + 1, t->r);
mergeArray(t->arr, t->l, middle, t->r);
pthread_exit(0);
}
void swap(int* a, int* b)
{
int temp = *a;
*a = *b;
*b = temp;
}