very very very easy for anexpert in c

[enjoy]

/*my english is not correct but ...*/
/*we have an error into tri boucle*/
/*this program can organise a table in croissant order*/
#include "stdio.h"
#define n 1000
void main()
{/*long tab*/
int na,i,i1,i2,k,x,t[n];
while((na>n)||(na<=0))
{
printf("donner long tab\n");
scanf("%i",&na);
}
for(i=0;i<na;i++)
{/*data table*/
printf("donnez contenue case %i",i);
scanf("%i",&t[i]);
}
k=1;

while(k!=0){/*boucle ordering table ----->you can find an error here*/
for(i1=0;i1<na;i1++)
{

while(k!=0)
{
k=0;
for(i2=1;i2<na;i2++)
{
if(t[i2]<t[i1])
{
k=1;

x=t[i2];
t[i2]=t[i1];
t[i1]=x;
printf("k");
}
}
}
}
}
for(i=0;i<na;i++)
{
printf(" %i ",t[i]);
}
}

[noob2c]

could u please translate into english as to what issue u are having ?

[enjoy]

help me please i have just translate it in english !!!....(my english is no correct but i try ....)

[nonpuz]

first, please use CODE tags, its quite troublesome to read without indentation...

Can you explain what it is you are trying to accomplish with this:

while(k!=0){
for(i1=0;i1<na;i1++)
{

  while(k!=0) 
  {
    k=0;
    for(i2=1;i2<na;i2++)
    {
        if(t[i2]<t[i1])
        {
          k=1;

          x=t[i2];
          t[i2]=t[i1];
          t[i1]=x;
          printf("k");
        }
      }
    }
  }
} 
  for(i=0;i<na;i++)
  {
    printf(" %i ",t[i]); 
  }
}

[enjoy]

i try to order the table in order
====>you have missing the
k=1;
***********please help me to order this table

[Hammer]

Study this and see if it helps you.

 #include <stdio.h>
 
 #define SIZE 1000
 
 int main(void)
 {
   int num = 1;
   int myArray[SIZE];
   int Counter = 0;
   int i;
   int j;
   
   while (num > 0 && Counter < SIZE)
   {
     printf ("Enter number, or 0 to end:"); 
     fflush(stdout);
     if (scanf("%d", &num) == 1)
     {
       if (num > 0)
       {
         myArray[Counter] = num;
         Counter++;
       }
     }
     else
     {
       while (getchar() != '\n')
         ;
     }
   }
   
   for (i = 0; i < Counter; i++)
   {
     for (j = 0; j < Counter - i - 1; j++)
     {
       if (myArray[j] > myArray[j+1])
       {
         int temp = myArray[j];
         myArray[j] = myArray[j+1];
         myArray[j+1] = temp;
       }
     }
   }
   
   for (i = 0; i < Counter; i++)
   {
     printf(" %d ", myArray[i]);
   }
   
   return 0;
 }