what's the best algorithm for selection sort?

[barracuda]

does anyone know whats wrong with this code?

#include <stdio.h>
#include <stdlib.h>
void swap (int a, int b){
    int temp;
    temp = a;
    a = b;
    b = temp;
}

void Selection_Sort (int A[], int size){
    int i,j;

    for ( i = 0; i < size; i++){
        for ( j = i+1; j < size; j++){
            if (A[i] > A[j]){
                swap(A[j],A[i]);
            }
        }
    }
}


int main()
{
    int n,i;
    int A[100];

    printf("Enter the number of elements to be sorted: ");
    scanf("%d",&n);
    for(i=0;i<n;++i)
      {
       printf("%d. Enter element: ",i+1);
       scanf("%d",&A[i]);
    }
    Selection_Sort(A, n);

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

}

[lastchance]

a and b are passed by value to swap(). Make them references, or their revised values won't go back to the calling function.