SUBMISSION+TUCK+GING

code format="cpp" //Very clean. I like //Challenge 1
 * 1) include

int main {

using namespace std;

int Tables[10]={88, 44, -21, 0, 23, 8, -34}; int i;

int temp=0;       //for temp storage to compare int max=Tables[0]; //to store max int min=Tables[0]; //to store min int sum=0;        //to store sum int n=7;      //to keep track no. of elements int reverse[10];  //to store reverse order

for (i=0;imax){                                                    //Task 1 max=temp; }       if (temp<min){                                                     //Task 2 min=temp; }       reverse[n-1-i]=Tables[i];                                          //Task 5 }

cout << "Max   : " << max << endl; cout << "Min   : " << min << endl; cout << "Average: " << sum/7 << endl;                                 //Task 3 cout << "Reverse: "; for (i=0;i> query; for (i=0;iallo[i+1]){ temp=allo[i]; allo[i]=allo[i+1]; allo[i+1]=temp; swap=1; }       }    } while (swap==1);

for (i=0;i<length;i++){ cout<<allo[i]<<" "; }

cout<<endl<<endl;

system("pause"); return 0; } code