Sorting elements of array in ascending order

Question

I made this program which sorts the elements of an array in an ascending order and then prints out the sorted array.

#include <stdio.h>
int main()
{
 int size, array[1000];
 scanf("%d", &size); 
 for (int i=0; i<size; i++)
 { 
 scanf("%d", array[i]);
 }
 int count, max, pos;
 count = size-1;
 max = array[0];
 for (int j=0; j<size; j++)
 {
 for (int k=0; k<=count; k++)
 {
 if (array[k]>max) 
 {
 max=array[k];
 pos=k; 
 }
 array[count]=array[pos];
 array[pos]=array[count];
 count--;
 }
 }
 for (int l=0; l<size; l++)
 {
 printf("%d ", array[l]); 
 } 
 return 0;
}

• Zeta: This question is incomplete. To help reviewers give you better answers, please add sufficient context to your question. The more you tell us about what your code does and what the purpose of doing that is, the easier it will be for reviewers to help you. Questions should include a description of what the code does
• Zeta: While your edit says that you're going to sort an array, your actually sorting an array of daily temperatures that are getting read in from standard input. Details like this should be embedded in your question, together with your rationale, e.g. why do you store 1000 days, what algorithm did you try, why did you use said algorithm, are you interested in better algorithms. If you say more about your code you will get better* code reviews. (*better in terms of more specific to you, than to a general audience)
• Soha Farhin Pine: @Zeta Haha. Lol. It has literally absolutely nothing do with temperatures. temp, day[n]. Sorry. It's all part of a more complex problem from Codeforces. tempis a commonly used variable name in C/C++; it's like a count variable. That array named day is for a wholly different purpose. That is, how long it takes to learn a particular instrument. All of this is completely irrelevant to my actual focus. So, I decided to leave it out. :-)
• kfx: What makes you think this program sorts the array? As far as I can tell, it iterates only through the first half of the array, setting the elements to the maximum found so far, as well as includes some code that efficiently does nothing (the line array[pos]=array[count]; - I can guess that meant to swap the elments, but it does not work that way. Seriously though, use the qsort function for Codeforces.
• Zeta: As kfx said, does this program actually work?

Answer 1

This element swap won't work:

array[count]=array[pos];
array[pos]=array[count];

You are assigning b to a, and then immediately a to b. In C, you will need to use a temporary variable for this operation, like so:

int buffer;
buffer=array[count];
array[count]=array[pos];
array[pos]=buffer;