

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The implementation of selection sort algorithm using c# programming language. The code generates an array of 10 random numbers, sorts them using selection sort method, and displays the sorted array step by step. This can be useful for students and developers to understand the working of selection sort algorithm.
Typology: Essays (high school)
1 / 3
This page cannot be seen from the preview
Don't miss anything!


using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Selection_Sort { class Program { static void Main(string[] args) { Selection_Sort selection = new Selection_Sort(10); selection.Sort(); } } class Selection_Sort { private int[] data; private static Random generator = new Random(); //Create an array of 10 random numbers public Selection_Sort(int size) { data = new int[size]; for (int i = 0; i < size; i++) { data[i] = generator.Next(20, 90); } } public void Sort() { Console.Write("\nSorted Array Elements :(Step by Step)\n\n"); display_array_elements(); int smallest; for (int i = 0; i < data.Length - 1; i++) { smallest = i; for (int index = i + 1; index < data.Length; index++) { if (data[index] < data[smallest]) { smallest = index; } } Swap(i, smallest); display_array_elements(); } } public void Swap(int first, int second) { int temporary = data[first]; data[first] = data[second]; data[second] = temporary;
public void display_array_elements() { foreach (var element in data) { Console.Write(element + " "); } Console.Write("\n\n"); } } }