Сортировка массива!

#include <iostream.h>;
#include <conio.h>;
#include <math.h>;
#include <stdlib.h>
#include <time.h>
int main()
{
const int n = 10;
int a[n],k,imax,max,c,q,j;
signed long int p=1;
for (int i=0; i<n; i++)
{ a[i]=rand()%40-20;
cout<<"\n \n"<<a[i];}
for (q=0; q<n-1; q++)
{j=0;
for (i=q+1; i<n; i++)
if (a[k]>a[i])
{j=a[q];
a[q]=a[i];
a[i]=j;}}
 
cout<<"\n vvedite c= ";
cin>>c;
k=0;
for(i=0;i<n;i++)
if(a[i]>c) k=k+1;
cout<<"\n k="<<k;
max=abs(a[0]);
imax=1;max=1;
for (i=1; i<n; i++)
if (abs(a[i])>max)
{max=abs(a[i]); imax=i;}
for (i=1;i<n; i++)
if (i>imax) p=p*a[i];
cout<<"\n p="<<p;
 
getch();
return 0;
}

//---------------------------------------------------------------------------
#include <iostream>
//---------------------------------------------------------------------------
void BubbleSort(int array[], int col)
{
  int temp = 0;
  for (int i = 1; i < col; i++)
    for (int j = 0; j < col - i; j++)
      if (array[j] > array[j+1]) {
        temp = array[j]; array[j] = array[j+1]; array[j+1] = temp;
      }
}
//---------------------------------------------------------------------------
int main(int argc, char* argv[])
{
  const int Size = 20;
  int Mas[Size];
 
  std::cout << std::endl << "Source massive:" << std::endl;
  for (int i = 0; i < Size; i++) {
    Mas[i] = std::rand() % 100;
    std::cout << Mas[i] << " ";
  }
 
  BubbleSort(Mas,Size);
 
  std::cout << std::endl << "Sorted massive:" << std::endl;
  for (int i = 0; i < Size; i++) {
    std::cout << Mas[i] << " ";
  }
 
  std::cout << std::endl;
  std::system("pause");
  return 0;
}
//---------------------------------------------------------------------------

#include <iostream.h>

 cout << endl << "Sorted massive:" << endl;
  for (int i = 0; i < Size; i++) { // (Error: Multiple declaration for 'i' )
   cout << Mas[i] << " ";
  }
 
  cout << endl;
 system("pause");
  return 0;
} // ( Warning: Parametr 'arge' is never used )

int i = 0;