-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstringmerge.cpp
69 lines (68 loc) · 1.29 KB
/
stringmerge.cpp
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
#include<stdio.h>
#include<stdlib.h>
int ts=0;
void merge(char arr[],int lb,int mid,int ub);
void mergesort(char arr[],int lb,int ub)
{
int mid;
if(lb<ub)
{
mid=(lb+ub)/2;
mergesort(arr,lb,mid);
mergesort(arr,mid+1,ub);
merge(arr,lb,mid,ub);
}
}
void merge(char arr[],int lb,int mid,int ub)
{
int lb1,ub1,i,c=0;
lb1=lb;
ub1=mid+1;
i=lb;
int b[100];
while(lb1<=mid && ub1<=ub)
{
if(arr[lb1]<arr[ub1])
{
b[i]=arr[lb1];
lb1++;i++;
}
else
{
b[i]=arr[ub1];
ub1++;i++;
}
c++;
}
while(lb1<=mid)
{
b[i]=arr[lb1];
lb1++;
i++;
c++;
}
while(ub1<=ub)
{
b[i]=arr[ub1];
ub1++;
i++;
c++;
}
for(int i=lb;i<=ub;i++)
arr[i]=b[i];
ts+=c;
printf("\nlb=%d,ub=%d,mid=%d,count=%d",lb,ub,mid,c);
}
int main()
{
char arr[100],n=0;
printf("enter the string");
scanf("%s",arr);
for(int i=0;arr[i]!='\0';i++)
n++;
int lb=0;int ub=n-1;
mergesort(arr,lb,ub);
printf("\n The sorted list is \n");
printf("%s",arr);
printf("\ntotal no. of steps = %d",ts);
}