LTHDT-TH1

// 12520344_TH1.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>

#define MAX 1000

using namespace std;

int n=0;

int cRandom(int a, int b)
{
    return rand()%(b-a+1)+a;
}
void CreateArr(int arr[])
{
    for(int i=0;i<n;i++)
    {
        arr[i]=cRandom(-100, 100);
    }
}
void CreateArrByUser(int arr[])
{
    for(int i=0;i<n;i++)
    {
        cout<<"   Nhap vao phan tu thu "<<i+1<<":  ";
        cin>>arr[i];
    }
}
void Show(int arr[])
{
    for(int i=0;i<n;i++)
    {
        cout<<arr[i]<<"  ";
    }
    cout<<endl;
}
void Delete(int arr[], int position)
{
    for(int i=position;i<n-1;i++)
    {
        arr[i]=arr[i+1];
    }
    n--;
}
void ShowMax(int arr[])
{
    int max=arr[0];
    for(int i=1;i<n;i++)
    {
        if(arr[i]>max)
            max=arr[i];
    }
    cout<<"Cac phan tu co gia tri lon nhat trong mang: "<<endl;
    for(int i=0;i<n;i++)
    {
        if(arr[i]==max)
        {
            cout<<"     Phan tu thu "<<i+1<<", Gia tri: "<<max<<endl;
        }
    }
}
void ShowMin(int arr[])
{
    int min=arr[0];
    for(int i=1;i<n;i++)
    {
        if(arr[i]<min)
            min=arr[i];
    }
    cout<<"Cac phan tu co gia tri nho nhat trong mang: "<<endl;
    for(int i=0;i<n;i++)
    {
        if(arr[i]==min)
        {
            cout<<"     Phan tu thu "<<i+1<<", Gia tri: "<<min<<endl;
        }
    }
}
int DemSoAm(int arr[])
{
    int count=0;
    for(int i=0;i<n;i++)
    {
        if(arr[i]<0)
            count++;

    }
    return count;
}
int MaxAm(int arr[])
{
    int max=0;
    for(int i=0;i<n;i++)
    {
        if(arr[i]<0)
        {
            max=arr[i];
            break;
        }
    }
    for(int i=0;i<n;i++)
    {
        if(arr[i]<0&&arr[i]>max)
            max=arr[i];
    }
    return max;
}
int MinDuong(int arr[])
{
    int min=0;
    for(int i=0;i<n;i++)
    {
        if(arr[i]>0)
        {
            min=arr[i];
            break;
        }
    }
    for(int i=0;i<n;i++)
    {
        if(arr[i]>0&&arr[i]<min)
            min=arr[i];
    }
    return min;
}
int Find(int arr[], int value)
{
    int i=0;
    while(arr[i]!=value)
    {
        i++;
    }
    if(i==n)
        return -1;
    else
        return i;
}
int CountValue(int arr[], int value)
{
    int count=0;
    for(int i=0;i<n;i++)
    {
        if(arr[i]==value)
            count++;
    }
    return count;
}
void SelectionSort(int arr[])
{
    int minpos;
    for(int i=0;i<n-1;i++)
    {
        minpos=i;
        for(int j=i+1;j<n;j++)
        {
            if(arr[j]<arr[minpos])
                minpos=j;
        }
        swap(arr[minpos], arr[i]);
    }
}
int BinarySearch(int arr[], int value, int left, int right)
{

    if(left>right)
        return -1;
    else
    {
        int mid=(left+right)/2;
        if(arr[mid]>value)
            BinarySearch(arr[], value, left, mid-1);
        else if(arr[mid]<value)
            BinarySearch(arr[], value, mid+1, right);
        else
            return mid;
    }
}
int _tmain(int argc, _TCHAR* argv[])
{
    cout<<"So phan tu: "; cin>>n;

    int arrMain[MAX];
    CreateArr(arrMain);
    Show(arrMain);
    SelectionSort(arrMain);
    Show(arrMain);

#ifdef _DEBUG
    system("pause");
#endif

    return 0;

}