What,s wrong with this sorting algo?

Question

#include <stdio.h>

int main() {
int a[10]= {5, 4, 10, 1, 6, 2}, b[10];
int n, count=0;
scanf("%d",&n); //Ascending order sort

for(int i=0; i<n; i++){ //write sorted array a into array b
b[i]= 0;
}

for(int i=0; i<n; i++){
scanf("%d", &a[i]);
}

for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(a[i]>a[j]) count++;
} b[count]= a[i];
}

for(int i=0; i<n; i++){
printf("%d ", b[i]);
}

return 0;
}

Answer 1

Thank you, guys! got it
After this, the count is not returned to 0. It works now!