#include <iostream>
using namespace std;

void print_array(const int arr[], const int size)
{
	for (int i = 0; i < size; i++)
		cout << arr[i] << ' ';
	cout << endl;
}

void swap_elements(int arr[] , int a, int b)
// swap arr[a] and arr[b]
{
   int temp = arr[a];
   arr[a] = arr[b];
   arr[b] = temp;
}

int min_index(int arr[], int start_index, int size)
{
	int min_index = start_index;

	for (int i=start_index+1; i<size; ++i)
		if (arr[i] < arr[min_index])
			min_index = i;

	return min_index;
}

void select_sort(int arr[], const int size)
{
	for(int i=0; i<size-1; i++)
		swap_elements(arr, min_index(arr, i, size), i);
}

int* sorted(const int arr[], const int size)
{
	if (size <= 0)
		return nullptr;

	// allocate memory for a new array and copy arr elements into it
	int* rtn = new int[size];
	for (int i=0; i<size; ++i)
		rtn[i] = arr[i];

	select_sort(rtn, size);

	return rtn;
}

/**
 * search @arr for the value (@val)
 * 
 * @return: the index where @val was found
 * @return: -1 if NOT found
 */
int linear_search(const int arr[], int size, int val)
{
	for (int i = 0; i < size; i++) {
//		cout << "	   ** Loop iteration " << i+1 << "**\n";
	if (arr[i] == val)
		return i; // if we just found it, return the index
   }

   // we didn't find val so return "not found"
   return -1;
}

/**
 * search @arr (must be sorted) for the value (@val)
 *
 * @return: the index where @val was found
 * @return: -1 if NOT found
 */
int binary_search(const int arr[], int size, int val)
{
	int low = 0; // track current low index
	int high = size-1; // track current high index
	int mid; // for computing midpoint
	int counter = 0;

	while (low <= high) { // while the indices are still in order
/*
	  cout << "		 ** Loop iteration " << counter+1 << "**\n";
	  counter++;
*/
		mid = (low + high) / 2;	// compute midpoint of current range
		if (arr[mid] == val) // found, return index where found
			return mid;
		else if (val < arr[mid]) // value is in lower half
			high = mid - 1;
		else // (val is bigger, so in top half)
			low = mid + 1;
   }

   return -1;
}

int main()
{
	int arr3[] {0, 1, 2};
	print_array(arr3, 3);

	int arr5[] = {1, 3, 2, 9, 0};

	select_sort(arr5, 5);

	print_array(arr5, 5);

	int* dynamic_array = sorted(arr5, 5);
	print_array(dynamic_array, 5);
	delete[] dynamic_array;
	dynamic_array = nullptr;

	char arr_char[] = "char array";
	const char *ptr_char = "char array";
	ptr_char = arr_char;

	//arr_char = ptr_char;

	return 0;
}