lab1 (version 1.2)

#include <iostream>
#include <ctime>
#include <conio.h>
#include <cstdlib>
using namespace std;
#define N 10

int randomazer (int min, int max) {
	float random;
	random = rand();
	random = (random / RAND_MAX) * (max - min) + min;
	return((int)random);
}


void vstavki(int* A) {
	int j, i, ii;
	for (j = 0; j <= N; j++) {
		i = 1;
		while (i < N) {
			if (A[i] >= A[i - 1]) {
				i++;
			}
			else {
				while (A[i] < A[i - 1]) {
					ii = A[i - 1];
					A[i - 1] = A[i];
					A[i] = ii;
					i--;
				}
				i = N;
			}
		}
	}
}

void input_console (int* A) {
	int i;
	for (i = 0; i < N; i++) {
		cout << A[i] << " ";
	}
	cout << "\n";
}


int main() {
	float start_time, end_time, total_time;
	int key1, key2;
	int i;
	int A[N];
	int B[N]; //because we change array A in 1 sort
	cout << "Please input 0 if you want input numbers by yourself, and smth else number if not \n";
	cin >> key1;
	if (key1 == 0) {
		cout << "input numbers: ";
		for (i = 0; i < N; i++) {
			cin >> A[i];
			B[i] = A[i];
		}
	} else {
		for (i = 0; i < N; i++) {
			A[i] = randomazer(1, 10);
			B[i] = A[i];
		}
	}
	//cout << "It's your massiv:\n";
	//input_console(A);
	int marker = 1;
	while (marker) {
		cout << "Which algoritm do you want?\n";
		cout << "1.Insertion sorting\n";
		cout << "2.Pyramidal sorting\n";
		cout << "0.Exit\n";
		cout << "Please choose number: ";
		cin >> key2;
		start_time = clock();
		if (key2 == 0) {
			marker = 0;
		}
		if (key2 == 1) {
			vstavki(A);
			//input_console(A);
		}
		else {

		}
		end_time = clock();
		total_time = end_time - start_time;
		cout << "Time of work: ";
		cout << total_time << "\n";
	}
	_getch();
	return 0;
}