// pointertest1.cpp : Defines the entry point for the console application.
// ex6.2.1.cpp : Defines the entry point for the console application.
//pg 153 Chapter 6 c++ WF Overland

/********************************************** //original prog
****sort uses two algorithms to sort an array**
****from lowest to highest entry.**************
***********************************************
****this exercise is to change the code to***** //first exercise from book
****arrange from highest to lowest.************
***********************************************
****In this test, I wanted to see if I could*** //reminder of the test for me
**** get user input on how many elements*******
**** need to be sorted. This was a test of*****
**** my pointer knowledge.********************
**********************************************/



#include "stdafx.h"
#include <iostream>
using namespace std;

void define(int *p3);
void sort(int n);
void swap(int *p1, int *p2);
int a[10]; //this is where I'm not certain of y this works - only 10 positions!
int r; //used for user to define number of elements to be sorted

int main() {
	while (1){
	int i;
    define(&r);
	if (r == 0)
		break;
    for (i = 0; i < r; i++) {
        cout << "Enter array element #" << i << ": ";
        cin >> a[i];
    }
    sort(10);
    cout << "Here are all the array elements, sorted:" << endl;
    for (i = 0; i < r; i++)
        cout << a[i] << " " << endl;
	}
    return 0;
}


//Define function: defines number of elements to be sorted
//
void define(int *p) {
    cout << "Enter number of elements to sort (0 to exit): " << endl;
    cin >> r;
}

//Sort array function: sort array named a, having n
//elements.
//
void sort(int n) {
    int i, j, high;
	n = r;
    for (i = 0; i < n - 1; i++) {
        //This part of the loop finds the highest
        //element in the range i to n - 1; the index
        //is set to the variable names high.
        high = i;
        for (j = i + 1; j < n; j++)
            if (a[j] > a[high])  //shouldn't this have only 10 positions?
                high = j;
        //This part of the loop performs a swap if needed
        if (i != high)
            swap(&a[i], &a[high]);
    }
}

//Swap function.
//Swap the values pointed to by p1 and p2.
//
void swap(int *p1, int *p2) {
	int temp = *p1;
	*p1 = *p2;
	*p2 = temp;
}//end prog 

int c [50]={0};

int a[10]; 

int b[25]={0};

int r = 20; //increase this value to write more valuses to array A

int main() {
	
   
	int i;
    
    for (i = 0; i < r; i++) 
    {
        a[i]=1;
    }
 
    cout << "Here are all the array(s) elements" << endl;
    cout << "Array A" << endl;
    for (i = 0; i < r; i++)
        cout << a[i] << " ";

    cout << endl << endl;

    
    cout << "Array C" << endl;
    for (i = 0; i < 50; i++)
        cout << c[i] << " ";

    cout << endl << endl;

    cout << "Array B" << endl;
    for (i = 0; i < 25; i++)
        cout << b[i] << " ";

    
    cout << endl; 
    system("pause");
    


    return 0;
}