AI coding assistant for busy programmers

All

JavaScript

How do you implement an insertion sort algorithm in C#

C#

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace InsertionSortAlgorithm
{
    class Program
    {

static void Main(string[] args)
        {

int[] arr = new int[5] { 5, 4, 3, 2, 1 };

for (int i = 0; i < arr.Length - 1; i++) // loop through the array from the first element to the last element 
            {

for (int j = i + 1; j > 0; j--) // loop through the array from the second element to the first element 
                {

if (arr[j - 1] > arr[j]) // if the previous element is greater than the current element then swap them 
                    {

int temp = arr[j - 1]; // store in temp variable

arr[j - 1] = arr[j]; // replace value

arr[j] = temp; // assign temp variable value

}

Console.WriteLine("Sorted Array Elements: "); // print sorted array elements on console screen

foreach (int p in arr) // loop through each array elements and print them on console screen 
                Console.Write(p + " "); // print each array elements on console screen

Console.ReadLine(); // hold console screen until user press any key to close it

}// end of main method

}// end of class program  
}

🤖 Code Explanation

This is an example of an insertion sort algorithm written in C#. The algorithm works by looping through the array from the first element to the last element, and then looping through the array from the second element to the first element. If the previous element is greater than the current element, then the two elements are swapped. The algorithm then prints out the sorted array elements on the console screen.

AI coding assistant for busy programmers

How do you implement an insertion sort algorithm in C#

C#

🤖 Code Explanation

More problems solved in C#