Comparing two versions of the selection sort

Let's compare the following versions of the selection sort algorithm. They are really close and teh only difference is that the first version stores the minimal value and its position in the array and the other one saves only the porisition of the minimal value and gets the valus by accessing the array's element with at this position. We will compare the speed of these algorithms by executing selection sort with a really big array (N=100,000 or even N=200,000).

void ssort(int data[], int N)
{
  int i, min, ind;
  for(int j=0;j<N-1;j++){
    ind = j;
    min = data[ind];
    for(i=j+1;i<N;i++)
      if( data[i] < min ){
        ind = i;
        min = data[ind];
      }
    if( ind != j ){
      data[ind] = data[j];
      data[j] = min;
    }
  }
}

void ssort(int data[], int N)
{
  int i, min, ind;
  for(int j=0;j<N-1;j++){
    ind = j;
    for(i=j+1;i<N;i++)
      if( data[i] < data[ind] ){
        ind = i;
      }
    if( ind != j ){
      min = data[ind];
      data[ind] = data[j];
      data[j] = min;
    }
  }
}