/*********************************************************************

  C201 Fall 2006
  Dana Vrajitoru
  array_oper.cpp

  Functions concerning operations on arrays.

**********************************************************************/
#include <iostream>
using namespace std;
#include <cstdlib>

#include "array_oper.h"

// Outputs the elements of an array.
void Output(int *a, int size)
{
  cout << "The array has " << size << " elements." << endl
       << "The elements are: ";
  for (int i=0; i<size; i++)
    cout << a[i] << ' ';
  cout << endl;
}

// Initializes the elments of the array with random values between 0
// and limit-1
void Random_array(int *a, int size, int limit)
{
  for(int i=0; i<size; i++)
    a[i]=rand() % limit;
}

// A function that finds the minimum in an array of integers.
int Find_min(int *a, int size)
{
  int min = a[0];
  for (int i=1; i<size; i++)
    if (a[i] < min)
      min = a[i];
  return min;
}

// Swaps two integers.
void Swap(int &n, int &m)
{
  int temp = n;
  n = m;
  m = temp;
}

// Selection sort. Finds the minimum in the array and swaps it with 
// position 0. Then find the next minimum in the array and moves it 
// to position 1 and so on.
void Selection_sort(int *a, int size)
{
  for (int i=0; i<size-1; i++) {
    int mini = i;
    for (int j=i+1; j<size; j++)
      if (a[j] < a[mini])
        mini = j;
    if (mini != i)
      Swap(a[i], a[mini]);
  }
}

//Binary search. Searches for a value in a sorted array.
int Binary_search(int *a, int size, int value)
{
  int first=0, last = size-1, mid;
  while (first <= last) {
    mid = (first + last) /2;
    if (value == a[mid])
      return mid;
    else if (value < a[mid])
      last = mid-1;
    else
      first = mid+1;
  }
  return -1;
}