Advertisement
tockata

Arrays, problem 7: Array sort with Selection sort algorithm.

Apr 3rd, 2014
127
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C# 1.13 KB | None | 0 0
  1. using System;
  2.  
  3.     class SortAray
  4.     {
  5.         static void Main()
  6.         {
  7.             int[] myArray = { 5, 8, 2, 1, 4, -25, 2, 75, 34, -50, 0 };
  8.             int tempNumber;
  9.             int tempIndex = 0;
  10.             int minNumber = int.MaxValue;
  11.  
  12.             for (int indexToCompare = 0; indexToCompare < myArray.Length; indexToCompare++)
  13.             {
  14.                 for (int index = indexToCompare; index < myArray.Length; index++)
  15.                 {
  16.                     if (minNumber > myArray[index])
  17.                     {
  18.                         minNumber = myArray[index];
  19.                         tempIndex = index;
  20.                     }
  21.                 }
  22.                 tempNumber = myArray[indexToCompare];
  23.                 myArray[indexToCompare] = minNumber;
  24.                 myArray[tempIndex] = tempNumber;
  25.                 minNumber = int.MaxValue;
  26.             }
  27.             Console.WriteLine("Sorted array is: ");
  28.             for (int index = 0; index < myArray.Length; index++)
  29.             {
  30.                 Console.Write("{0} ", myArray[index]);
  31.             }
  32.             Console.WriteLine();
  33.         }
  34.     }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement