#include <iostream>
using namespace std;
//The purpose of this program is to sort the array elements in ascending order
//Tools
void restore(int arr[])
{
int a[20] = { 12,45,785,45,4524,56,35,784,913,45,645,963,412,56,36,98,45,763,8,1 };
for (int i = 0; i < 20; i++)
arr[i] = a[i];
}
void print(int arr[], int n)
{
for (int i = 0; i < n; i++)
cout << arr[i] << " " ;
cout << endl;
}
void swap(int& a, int& b)
{
int temp = a;
a = b;
b = temp;
}
bool check(int arr[], int n)
{
for (int i = 0; i < n-1; i++)
if (arr[i] > arr[i + 1]) {
//cout << "false" << endl;
return false;
}
return true;
cout << "All tests passed! Congratulations!" << endl;
}
//Simple Sorting
void InsertSort(int arr[], int n)
{
int temp, j;
for (int i = 1; i < n; i++)
{
j = i - 1;
temp = arr[i];
while (arr[j] > temp && j >= 0)
{
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = temp;
}
}
void SelectSort(int arr[], int n)
{
int temp, i, j, k;
for (i = 0; i < n; i++)
{
temp = arr[i];
k = i;
for (j = i + 1; j < n; j++)
if (arr[j] < arr[k])
k = j;
temp = arr[k];
arr[k] = arr[i];
arr[i] = temp;
}
}
void BubbleSort(int arr[], int n)
{
int i, j, temp;
for (i = 0; i < n; i++)
for (j = 0; j < n - i-1; j++)
if (arr[j] > arr[j + 1])
{
temp = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = temp;
}
}
//Complex Sorting
void ShellSort(int arr[], int n)
{
int temp;
for (int gap = n / 2; gap > 0; gap /= 2)
{
for (int i = gap; i < n; i++)
{
temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
arr[j] = arr[j - gap];
arr[j] = temp;
}
}
}
void QuickSort(int arr[], int start, int end)
{
if (start < end)
{
int i = start, j = end, temp = arr[i];
while (i < j)
{
while (i < j && arr[j] >= temp)
j--;
if (i < j)
arr[i++] = arr[j];
while (i < j && arr[i] <= temp)
i++;
if (i < j)
arr[j--] = arr[i];
}
arr[i] = temp;
QuickSort(arr, start, i - 1);
QuickSort(arr, i + 1, end);
}
}
//This function is for HeapSort
void shift(int arr[], int i, int j)
{
int temp = arr[i];
for (int k = 2 * i + 1; k < j; k = k * 2 + 1)
{
if (k + 1 < j && arr[k] < arr[k + 1])
k++;
if (arr[k] > temp)
{
arr[i] = arr[k];
i = k;
}
else
break;
}
arr[i] = temp;
}
void HeapSort(int arr[], int n)
{
int i, temp;
for (i = n / 2 - 1; i >= 0; i--)
shift(arr, i, n);
for (i = n - 1; i > 0; i--)
{
temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
shift(arr, 0, i);
}
}
void merge(int arr[], int low, int mid, int high)
{
int n1 = mid - low + 1;
int n2 = high - mid;
int* left = new int[n1];
int* right = new int[n2];
for (int i = 0; i < n1; i++)
left[i] = arr[low + i];
for (int i = 0; i < n2; i++)
right[i] = arr[mid + i + 1];
int i = 0, j = 0;
while (i < n1 && j < n2)
{
if (left[i] <= right[j])
arr[low++] = left[i++];
else
arr[low++] = right[j++];
}
while (i < n1)
arr[low++] = left[i++];
while (j < n2)
arr[low++] = right[j++];
delete[] left;
delete[] right;
}
void MergeSort(int arr[], int low, int high)
{
if (low < high)
{
int mid = (low + high) / 2;
MergeSort(arr, low, mid);
MergeSort(arr, mid + 1, high);
merge(arr, low, mid, high);
}
}
int main()
{
int errcount = 0;
for (int j = 0; j < 9999; j++)
{
int k = rand() % 999;
int *a = new int[k];
for (int i = 0; i < k; i++)
a[i] = rand() % 99;
ShellSort(a, k);//Replace
if (!check(a, k))
{
print(a, k);
errcount++;
}
delete[] a;
}
if (!errcount)
cout << "All tests passed! Congratulations!" << endl;
}
03-29
160
05-23
955
09-04
1162