KnutSortAndSearchAlgorCppSols/Сортировка естественным двухпутевым слиянием1.cpp at main · AlexSozd/KnutSortAndSearchAlgorCppSols · 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
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <iostream>
using namespace std;
struct Catridge
{
	int k;
	char r[10];
};
int main()
{
	int buf,d,f,i,j,k,l,n,ob,s;
	//char R[10];
	Catridge *tab;
	do
	{
		puts("Enter count of elements");
		cin>>n;
	}
	while(n<=0);
	tab=new Catridge[2*n];
	for(i=0;i<n;i++)
	{
		cout<<"Enter key of element #"<<i+1<<"\n";
		cin>>tab[i].k;
		cout<<"Enter value of element #"<<i+1<<"\n";
		cin>>tab[i].r;
	}
	//ob=0;
	s=0;
	i=0;
	j=n-1;
	k=n;
	l=2*n-1;
	d=1;
	f=1;
	do
	{
		//ob=0;
		f=1;
		while(i!=j)
		{
			if(tab[i].k>tab[j].k)
			{
				tab[k].k=tab[j].k;
				strcpy(tab[k].r,tab[j].r);
				//ob++;
				k=k+d;
				j=j-1;
				if(tab[j+1].k>tab[j].k)
				{
					do
					{
						tab[k].k=tab[i].k;
						strcpy(tab[k].r,tab[i].r);
						//ob++;
						k=k+d;
						i=i+1;
					}
					while(tab[i-1].k<=tab[i].k);
					f=0;
					d=-d;
					buf=k;
					k=l;
					l=buf;
				}
			}
			else
			{
				tab[k].k=tab[i].k;
				strcpy(tab[k].r,tab[i].r);
				//ob++;
				k=k+d;
				i=i+1;
				if(tab[i-1].k>tab[i].k)
				{
					do
					{
						tab[k].k=tab[j].k;
						strcpy(tab[k].r,tab[j].r);
						//ob++;
						k=k+d;
						j=j-1;
					}
					while(tab[j+1].k<=tab[j].k);
					f=0;
					d=-d;
					buf=k;
					k=l;
					l=buf;
				}
			}
		}
		tab[k].k=tab[i].k;
		strcpy(tab[k].r,tab[i].r);
		if(f==0)
		{
			s=1-s;
			if(s==0)
			{
				i=0;
				j=n-1;
				k=n;
				l=2*n-1;
			}
			else
			{
				i=n;
				j=2*n-1;
				k=0;
				l=n-1;
			}
			d=1;
			//f=1;
		}
		ob++;
		cout<<"Circle #"<<ob<<"\n";
	}
	while(f==0);
	for(i=0;i<n;i++)
	{
		//cout<<tab[i].k<<"\t"<<tab[i].r<<"\n";
		if(s=0)
		{
			cout<<tab[i+n].k<<"\t"<<tab[i+n].r<<"\n";
		}
		else
		{
			cout<<tab[i].k<<"\t"<<tab[i].r<<"\n";
		}
	}
	getch();
}