Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Simple Selection Sort
//Rextester.Program.Main is the entry point for your code. Don't change it. //Microsoft (R) Visual C# Compiler version 2.9.0.63208 (958f2354) using System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; namespace Rextester { public class Program { public static void Main(string[] args) { int[] arr = { 5, 8, 1, 8, 4, 5, 6, 5, 4 }; Console.WriteLine("Start Selection Sort"); Console.Write("Start array: "); arr.ToList().ForEach(x => Console.Write(x + " ")); //sort for (int i = 0; i < arr.Length; i++) { //index of minimum value int min_index = i; //find minimum value for (int j = i + 1; j < arr.Length; j++) { if (arr[j] < arr[min_index]) { min_index = j; } } //replace minimum and current value int c = arr[min_index]; arr[min_index] = arr[i]; arr[i] = c; } Console.Write("\nSorted array: "); arr.ToList().ForEach(x => Console.Write(x + " ")); } } }
run
|
edit
|
history
|
help
1
Luhn Formula Demo C#
BEISPEIL- AUGUST 6 -2019
Enemy Spawner
Catch redirect link
Talk To Jack
Sum Matrix Row
schach 1 sem
enum extension
binary search tree (insert, search, findmin, findmax, level-pre-in-post order traversals
Fórum ➡ Filling in a DataTable from a list of KVP's ♦