[فلمنقو]

السلام عليكم ....
يا شباب انا تعبني هذا الكود ياليت اعرف وين غلطي هذا السؤال

Write a C program that reads the size N of an integer Array called T (maximum size: 50 components),then :

- Fills the Array by values and displays the Array.
- Clear all occurrences of the value 0 in the Array T and squeeze (regroup) the remaining elements.
- Display the resulting Array.

وهذا كودي

#include<stdio.h>
void selSort(int x[], int n) /* function header */
{
int i, imin, j;
int temp;
for (i=0; i<n-1; i++)
{
/* search for smallest in unsorted list */
imin = i;
for (j=i; j<n; j++)
if ( x[j] < x[imin] )
imin=j; //sort
//swapping
temp = x[i];
x[i] = x[imin];
x[imin] = temp;
}
}
int main(void)
{
int x[49], size=50;
int i;
/* show unsorted list */
printf("Befor Sorting>\n");
for (i=0; i<size; i++)
{
printf("Enter digit No.%d > ", i+1);
scanf("%d", &x);
}
for (i=0; i<size; i++)
printf("x[%d]=%d \n", i, x[i]);
printf("----------------\n");
selSort(x,size); /* function call */
/* show sorted list */
printf("After Sorting>\n");
for (i=0; i<size; i++)
printf("x[%d]=%d \n", i, x[i]);
return (0);
}