What is the difference between the following two sorting algorithms?

[abdalimran]

I think both of this are algorithm of selection sort.

but what is the difference between this two algorithms

Algo 1:

void selectionSort(int arr[], int n)
{
    for(int i=0; i<7; i++)
    {
        for(int j=i+1; j<7; j++)
        {
            if(a[j]<a[i])
            {
                swap(a[i],a[j]);
            }
        }
    }
}

Algo 2:

void selectionSort(int arr[], int n)
{
    int i, j, min_idx;

    for (i = 0; i < n-1; i++)
    {
        min_idx = i;
        for (j = i+1; j < n; j++)
          if (arr[j] < arr[min_idx])
            min_idx = j;

        swap(arr[min_idx], arr[i]);
    }
}

[Esslercuffi]

not much... but the top one can potentially swap more than one pair per iteration of i. whereas the bottom one basically finds the lowest candidate in the list before making the swap.

[anup30]

first one is bubble sort