Sample C++ program

//Program for project 1 written by Rajesh Shanam(CS501) Fall 2014
#include<iostream>
#include<new>

using namespace std;
void bubblesort(int *,int);

int main()
{
int i,j,count,arr_size,max,over,*arr,*arr_mode,*arr_true;

cout<<"\nHow many no would you like  to give? : ";
cin>>arr_size;
//Initializing Arrays
arr=new (nothrow) int[arr_size];
arr_mode=new (nothrow) int[arr_size];
arr_true=new (nothrow) int[arr_size];


//Taking numbers from User
for(i=0;i<arr_size;i++)
{
cout<<"enter no: ";
cin>>arr[i];
}
//Displaying UnSorted ascending list
cout<<"\nUnsorted List:\n"<<endl;

for(i=0;i<arr_size;i++)
{
cout<<arr[i]<<"\t";
}

bubblesort(arr,arr_size);
//Displaying Sorted descending list
cout<<"\nSorted List(ascending)\n"<<endl;

for(i=0;i<arr_size;i++)
{
cout<<arr[i]<<"\t";
}
//Displaying Sorted descending list
cout<<"\n";
cout<<"\nSorted List(descending)\n"<<endl;

for(i=arr_size-1;i>=0;i--)
{
cout<<arr[i]<<"\t";
}

cout<<"\n";

//Code for Max,Min,Range,Median
cout<<"\nMaximum:"<<arr[arr_size-1]<<endl;

cout<<"\nMinimum:"<<arr[0]<<endl;

cout<<"\nRange:"<<arr[arr_size-1]-arr[0]<<endl;

cout<<"\nMedian:"<<arr[(arr_size+1)/2]<<endl;

//Logic for counting frquency for each element and storing them in arr_mode
for(i=0;i<arr_size;i++)
 {
  count=0;
  for(j=0;j<arr_size;j++)
   {
    if(arr[i]==arr[j])
        {
          count++;
        }
   }
   arr_mode[i]=count;
 }
max=arr_mode[0];

//Logic for finding maximum frequency count
for(i=1;i<arr_size;i++)
{
  if(max<arr_mode[i])
  {
    max=arr_mode[i];
  }
}

//Logic for finding which index positions have maximum frequency counts
for(i=0;i<arr_size;i++)
{
if(arr_mode[i]==max)
{
  arr_true[i]=1;
}
}

cout<<"\nModes:";
//Logic for displaying Modes of the given list
for(i=0,over=0;i<arr_size;i++)
{
if(arr_true[i] && over!=arr[i])
  {
   cout<<arr[i]<<"\t";
   over=arr[i];
  }
}
cout<<"\n";
return(0);
}

//bubblesort function for sorting a given array.N is length of array
void bubblesort(int * a,int N)
{
int i,j,temp;
for(i=1;i<N;i++)
 {
for(j=0;j<N-1;j++)
  {
   if(a[j]>a[j+1])
      {
      temp=a[j];
      a[j]=a[j+1];
      a[j+1]=temp;
      }
  }
 }
}