Sub Сортировка()
    
    Dim mass(4, 9) As Variant
    
    Const nLine As Byte = 4
    Const nColumn As Byte = 9
    
    ' массив из 5 строки и 10 столбцов
    For i = 0 To nLine
        For j = 0 To nColumn
            mass(i, j) = Cells(4 + i, 2 + j).Value
        Next j
    Next i
    
    'сортировка
    Dim iter_ As Byte
    iter_ = nLine * 4
    While iter_ > 0
    For i = 0 To nLine
    
    
        Dim iter As Byte
        iter = nLine
        While iter > 0
        For j = 0 To nColumn - 1
            If mass(i, j) > mass(i, j + 1) Then
                Dim temp As Variant
                temp = mass(i, j)
                mass(i, j) = mass(i, j + 1)
                mass(i, j + 1) = temp
            End If
        Next j
        iter = iter - 1
        Wend
        
      Dim k As Byte
      k = i
        If k < 4 Then
            If mass(k, nColumn) > mass(k + 1, 0) Then
                Dim temp_1 As Variant
                temp_1 = mass(k, nColumn)
                mass(k, nColumn) = mass(k + 1, 0)
                mass(k + 1, 0) = temp_1
            End If
        End If
    Next i
    iter_ = iter_ - 1
   Wend
    
    'вывод массива
     For i = 0 To nLine
        For j = 0 To nColumn
            Worksheets("4.10").Cells(13 + i, 1 + j) = mass(i, j)
        Next j
    Next i
End Sub

int cmp(const void *arg_1, const void *arg_2) // компаратор

{
   if (*(float*)arg_1 > *(float*)arg_2)
   {
      return 1;


   }
   else
      if (*(float*)arg_1 < *(float*)arg_2)
      {
         return -1;
      }
      else
      {
         return 0;
      }
}

qsort( *mass, 50, sizeof(float), cmp); // вызов

void SortSpiral(float mass[][10], const int nLine, const int nColumn)
{
   int iter_1 = 5*nLine;
   while (iter_1--)
   {
      for (int k = 0; k < nLine; k++) {

         int iter_2 = nLine;
         while (iter_2--)
         {
            for (int j = 0; j < nColumn - 1; j++)
            {
               if (mass[k][j] > mass[k][j + 1])
               {
                  float temp = mass[k][j];
                  mass[k][j] = mass[k][j + 1];
                  mass[k][j + 1] = temp;
               }
                  
               
            }
         }
         if (k < nLine - 1 && mass[k][nColumn - 1] > mass[k + 1][0])
         {
            float temp = mass[k][nColumn - 1];
            mass[k][nColumn - 1] = mass[k + 1][0];
            mass[k + 1][0] = temp;
         }
      }
   }
   return;
}

Sub Сортировка_матрицы()
' Сортировка_матрицы Макрос
For i = 13 To 17
For j = 1 To 10

For k = 13 To 17
For l = 1 To 10

If l = 10 And k = 17 Then
' Ничего не делаем
Else

If l = 10 And Cells(k, l).Value > Cells(k + 1, 1).Value Then

Temp = Cells(k, l).Value
Cells(k, l).Value = Cells(k + 1, 1).Value
Cells(k + 1, 1).Value = Temp

Else

If Cells(k, l).Value > Cells(k, l + 1).Value Then

Temp = Cells(k, l).Value
Cells(k, l).Value = Cells(k, l + 1).Value
Cells(k, l + 1).Value = Temp

End If
End If
End If

Next l
Next k

Next j
Next i
End Sub