arraay01.cpp

数据结构常用算法合集

//array01.cpp
#include <iostream.h>
#include <iomanip.h>
#include <conio.h>
void main()
{ int a[10],i,t,j;
  i=0;
  do
  { a[i] = i * 2 - 1;
    i++;
  } while (i<10);
  i=0;							           //  i		a[i] 	  i		a[i]
  while (i<10)			 		         //a[0]=			  a[5]=
  { 								         //a[1]= 		     a[6]=
    cout << "a[" << i <<"]="        //a[2]= 			  a[7]=
        << setw(3) << a[i] << endl;	//a[3]= 			  a[8]=
    i++;							         //a[4]= 			  a[9]=
  }
  for (i=0;i<5;i++)
  { t = a[i];
    a[i]=a[i+5];
    a[i+5]=t;				     //j  0  1   2  3  4	 5   6  7   8  9
    j=0;					        //0 ___ ___ ___ ___ ___ ___ ___ ___ ___ ___
    for (j=0;j<10;j++)		  //1 ___ ___ ___ ___ ___ ___ ___ ___ ___ ___
    cout << setw(4) << a[j]; //2 ___ ___ ___ ___ ___ ___ ___ ___ ___ ___
    cout << endl;			     //3 ___ ___ ___ ___ ___ ___ ___ ___ ___ ___
   }						        //4 ___ ___ ___ ___ ___ ___ ___ ___ ___ ___
   getch();
}