Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- using System.Collections.Generic;
- using System.Linq;
- namespace Sortign
- {
- class Program
- {
- static void Main(string[] args)
- {
- int[] numbers = Console.ReadLine().Split(" ").Select(int.Parse).ToArray();
- selectionSort(numbers);
- printArray(numbers);
- }
- static void selectionSort(int[] arr)
- {
- int n = arr.Length;
- // One by one move boundary of unsorted subarray
- for (int i = 0; i < n - 1; i++)
- {
- // Find the minimum element in unsorted array
- int min_idx = i;
- for (int j = i + 1; j < n; j++)
- if (arr[j] < arr[min_idx])
- min_idx = j;
- // Swap the found minimum element with the first
- // element
- int temp = arr[min_idx];
- arr[min_idx] = arr[i];
- arr[i] = temp;
- }
- }
- // Prints the array
- static void printArray(int[] arr)
- {
- int n = arr.Length;
- for (int i = 0; i < n; ++i)
- Console.Write(arr[i] + " ");
- Console.WriteLine();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement