// CS201 HW08
// Problem 01

#include <iostream>
using namespace std;

typedef int* IntArrayPtr;

int main()
{
	int max_val;

	cout << "Enter the highest number you want checked for primes: ";
	cin >> max_val;

	IntArrayPtr array;
	array = new int[max_val];

	for (int i=0; i < max_val; i++)
	{
		array[i] = 1;
	}

	for (int j=2; j<max_val; j++) // sifting out the primes
	{
		if(array[j])  //if the val is 1, then go through and make all further iterations 0
		{
			for(int k=2*j; k < max_val; k+=(j))
			{
				array[k] =0;
			}
		}
	}

	for (int a=1; a<max_val; a++) // now cout-ing everything that's prime
	{
		if(array[a])     // if the val is 1, cout
		{
			cout << a << ' ';
		}
	}
    cout << endl;

   	 
    delete [] array;
	return 0;
}

/*
Enter the highest number you want checked for primes: 100
1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
Press any key to continue
*/



// CS201 HW08
// Problem 02

#include <iostream>
using namespace std;
 
void delete_repeats(char array[], int &size);

int main()
{
	char a[10];
	a[0]='a';
	a[1]='a';
	a[2]='c';
	a[3]='a';
	int size=4;
	
	for (int i=0; i<size; i++)
	{
		cout << a[i] << endl;
	}
	
	delete_repeats(a, size);
	cout << endl;

	for (int x=0; x<size; x++)
	{
		cout << a[x] << endl;
	}


	return 0;
}


void delete_repeats(char array[], int &size)
{
	for (int i=0; i < size; i++)
	{
		for (int a=i+1; a < size; a++)
		{
			if (array[i] == array[a])
			{
				for (int b=a; b < size; b++)
				{
					array[b] = array[b+1];
				}
				
			size--;
			}
		}
	}
}

/*
a
a
c
a

a
c
Press any key to continue
*/