Multithreaded-Sorting-Application/MultiThread Sorting Application1.c at master · TanishGuleria/Multithreaded-Sorting-Application · GitHub

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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include<stdio.h>
#include<sys/types.h>
#include<fcntl.h>
#include<pthread.h>
int a[30],b[15],c[15],d[30];//globally declare array
int sublistsize1,sublistsize2;
//function for first sublist
void sublist1(int a[])
{
sleep(1);
 int i,j,temp;
 for(i=0;i<sublistsize1;i++)
 {
  for(j=0;j<sublistsize1-i-1;j++)
  {
    if(a[j+1]<a[j])
    {
       temp=a[j];
       a[j]=a[j+1];
       a[j+1]=temp;
    }
  }
 }

for(i=0;i<sublistsize1;i++)
{
  b[i]= a[i];
}
printf("First Sorted array:\n");
for(i=0;i<sublistsize1;i++)
{
  printf("%d \t",b[i]);
}
}

//function for second sublist
void sublist2(int a[])
{
sleep(2);
 int i,j,temp;
 for(i=0;i<sublistsize2;i++)
 {
  for(j=0;j<sublistsize2-i-1;j++)
  {
    if(a[j+1]<a[j])
    {
       temp= a[j];
       a[j]=a[j+1];
       a[j+1]=temp;
    }
  }
 }
for(i=0;i<sublistsize2;i++)
{
  c[i]=a[i];
}
printf("\nSecond Sorted array:\n");
for(i=0;i<sublistsize2;i++)
{
  printf("%d \t",c[i]);
}
}

//mergelist
void mergelist(int a[])
{
sleep(3);
 int i,k,j,temp;
 int totalSize = sublistsize1+sublistsize2;
 for(i=0;i<sublistsize1;i++)
 {
  a[i]=b[i];
 }
 k=sublistsize1;
 for(i=0;i<sublistsize2;i++)
 {
  a[k]=c[i];
 k++;
 }
 printf("\nMerged Array: \n");
 for(i=0;i<totalSize;i++)
 {
  d[i] = a[i];
   printf("%d \t",d[i]);
 }

 for(i=0;i<totalSize;i++)
 {
   for(j=0;j<totalSize-i-1;j++)
   {
	if(d[j+1]<d[j])
   	{
     		temp=d[j];
		d[j]=d[j+1];
    		d[j+1]=temp;
	}
   }
 }
 printf("\nMerge SOrt: \n");
 for(i=0;i<totalSize;i++)
 {
   printf("%d \t",d[i]);
 }
}
//main
void main()
{
 int n,i,j=0,k=0;
 pthread_t th1,th2,th3;
 printf("Enter size of array:");
 scanf("%d",&n);
 for(i=0;i<n;i++)
 {
 scanf("%d",&a[i]);
 }
for(i=0;i<n/2;i++)
{
 b[j]=a[i];
j++;
}
sublistsize1= j;
for(i=n/2;i<n;i++)
{
 c[k]=a[i];
 k++;
}
sublistsize2=k;
printf("First array:\n");
for(i=0;i<n/2;i++)
{
printf("%d \n",b[i]);
}
printf("Second array:\n");

for(i=0;i<n/2;i++)
{
printf("%d\n",c[i]);
}
pthread_create(&th1,NULL,sublist1,&b);
pthread_create(&th2,NULL,sublist2,&c);
pthread_create(&th3,NULL,mergelist,&d);
pthread_join(th1,NULL);
pthread_join(th2,NULL);
pthread_join(th3,NULL);
}