typedef int Number;

/* tests use of sorting a list of integers with the quick_sort  
   algorithm and the recursion method 
	C.A. Bertulani, 06/14/2000
*/
#include<iostream.h>
#include<math.h>
#include"butil.h"

void swap(Number& first, Number& second){
	Number temp = first;
	first = second;
	second = temp;
}

void quick_sort(int list[], int left, int right){
	int pivot, left_arrow, right_arrow;
        
	left_arrow = left;
	right_arrow = right;
	pivot = list[(left + right)/2];
        do
		{while (list[right_arrow] > pivot)
			right_arrow--;
		while (list[left_arrow] < pivot)
			left_arrow++;
		if (left_arrow <= right_arrow)
		{
			swap(list[left_arrow], list[right_arrow]);
			left_arrow++;
			right_arrow--;
		}
		}
		while (right_arrow >= left_arrow);
        if (left < right_arrow)
			quick_sort(list, left, right_arrow);
		if (left_arrow < right)
			quick_sort(list, left_arrow, right);
}

int main() {
    /* Create array with elements from a pre-defined formula  */
	void quick_sort(int [], int , int);
    long unsigned n,i; 
	Number* b;
	cout << "enter number of points" << endl;
    cin >> n;
    b = vector(n);

	/* enter desired formula here */
	double x = 2.; 
    for (i = 1; i <= n; i++) {
		x=50*cos(x-3.1);
		b[i]=int(x);
        cout << i <<  "  " << b[i] << " " <<endl;
    };
	cout << endl;

	/* Call sorting routine to order array */
    quick_sort(b, 1, n);
    for (i = 1; i <= n; i++) {
        cout << i <<  "  " << b[i] << endl;
    }

	delete []b;
	return 0;
}