Sort Help

I have to implement different types of sorts and I'm getting some crazy errors about them being illegal and something about the file ending before the left of brace and it shows the file path. in my merge sort the while(i <n1) is complaining yet the while loop under is fine I'm not sure whats going on

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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
  #include<iostream>
using namespace std;



void bubbleSort(int aarr[1000], int n)
{
	int count;
	int arr[1000];
	for (int i = 0; i < 1000; i++)
	{

		arr[i] = aarr[i];

	}
	bool swapped = true;
	int j = 0;
	int tmp;
	while (swapped)
	{
		swapped = false;
		j++;
		for (int i = 0; i < n - j; i++)
		{
			if (arr[i] > arr[i + 1])
			{
				tmp = arr[i];
				arr[i] = arr[i + 1];
				arr[i + 1] = tmp;
				swapped = true;
				count++;
			}
		}
		cout << "\nSorted list is as follows\n";
		for (int i = 0; i<n; i++)
		{
			cout << aarr[i] << " ";
		}
		
	}
	
}


void selectionSort(int aarr[1000], int n)
{
	
	int arr[1000];
	int tmp;
	for (int i = 0; i < 1000; i++)
	{

		arr[i] = aarr[i];

	}
	for (int i = 0; i<n - 1; i++)
	{
		for (int j = i + 1; j<n; j++)
		{
			if (arr[i]>aarr[j])
			{
				
		}

		tmp = arr[i];
		arr[i] = aarr[tmp];
		aarr[i] = tmp;
	}

	cout << "\nSorted list is as follows\n";
	for (i = 0; i<n; i++)
	{
		cout << aarr[i] << " ";
	}
}

//void shortbubbleSort(int aarr[1000], int n)
//{
//	int arr[1000];
//	for (int i = 0; i < 1000; i++)
//	{
//
//		arr[i] = aarr[i];
//
//	}
//	bool swapped = true;
//	int j = 0;
//	int tmp;
//	while (swapped)
//	{
//		swapped = false;
//		j++;
//		for (int i = 0; i < n - j; i++)
//		{
//			if (arr[i] > arr[i + 1])
//			{
//				tmp = arr[i];
//				arr[i] = arr[i + 1];
//				arr[i + 1] = tmp;
//				swapped = true;
//			}
//		}
//	}
//}

void InsertionSort(int aarr[1000], int n)
{
	int arr[1000];
	for (int i = 0; i < 1000; i++)
	{

		arr[i] = aarr[i];

	}
	for (int i = 0; i < length; i++){
		j = i;

		while (j > 0 && arr[j] < arr[j - 1]){
			temp = arr[j];
			arr[j] = arr[j - 1];
			arr[j - 1] = temp;
			j--;
		}
	}
}

void merge(int aarr[1000], int l, int m, int r)
{
	int i, j, k;
	int n1 = m - l + 1;
	int n2 = r - m;
	

	/* create temp arrays */
	int L[n1], R[n2];

	/* Copy data to temp arrays L[] and R[] */
	for (i = 0; i < n1; i++)
		L[i] = arr[l + i];
	for (j = 0; j < n2; j++)
		R[j] = arr[m + 1 + j];

	/* Merge the temp arrays back into arr[l..r]*/
	i = 0; // Initial index of first subarray
	j = 0; // Initial index of second subarray
	k = l; // Initial index of merged subarray
	while (i < n1 && j < n2)
	{
	
		if (L[i] <= R[j])
		{
			arr[k] = L[i];
			i++;
		}
	else
		{
			arr[k] = R[j];
			j++;
		}
		k++;
	}

	/* Copy the remaining elements of L[], if there
	are any */
	
    while (i < n1)
	{
	   arr[k] = L[i];
		i++;
		k++;
	}

	/* Copy the remaining elements of R[], if there
	are any */
	while (j < n2)
	{
		arr[k] = R[j];
		j++;
		k++;
	}
}

/* l is for left index and r is right index of the
sub-array of arr to be sorted */
void mergeSort(int arr[], int l, int r)
{
	if (l < r)
	{
		// Same as (l+r)/2, but avoids overflow for
		// large l and h
		int m = l + (r - l) / 2;

		// Sort first and second halves
		mergeSort(arr, l, m);
		mergeSort(arr, m + 1, r);

		merge(arr, l, m, r);
	}
}


void heapify(int arr[], int n, int i)
{
	int largest = i;  // Initialize largest as root
	int l = 2 * i + 1;  // left = 2*i + 1
	int r = 2 * i + 2;  // right = 2*i + 2

	// If left child is larger than root
	if (l < n && arr[l] > arr[largest])
		largest = l;

	// If right child is larger than largest so far
	if (r < n && arr[r] > arr[largest])
		largest = r;

	// If largest is not root
	if (largest != i)
	{
		swap(arr[i], arr[largest]);

		// Recursively heapify the affected sub-tree
		heapify(arr, n, largest);
	}
}

// main function to do heap sort
void heapSort(int arr[], int n)
{
	// Build heap (rearrange array)
	for (int i = n / 2 - 1; i >= 0; i--)
		heapify(arr, n, i);

	// One by one extract an element from heap
	for (int i = n - 1; i >= 0; i--)
	{
		// Move current root to end
		swap(arr[0], arr[i]);

		// call max heapify on the reduced heap
		heapify(arr, i, 0);
	}
}



int main()
{
	int A[1000];
	for (int i = 0; i < 1000; i++)
	{

		A[i] = rand();

	}
	int B[1000];
	for (int i = 0; i > 1000; i++)
	{

		B[i] = rand();

	}	
	int C[1000];
	for (int i = 0; i < 1000; i++)
	{

		C[i] = rand();

	}

	bubbleSort(A,1000);
	//bubbleSort(B, 1000);
	//bubbleSort(C, 1000);
	


	system("pause");
	return 0;

}
There is an open brace on line 61 without a matching closing brace.
Wow I can't believe I missed that lol do you have any advice on implementing each array in main
Topic archived. No new replies allowed.