Breaking News: Grepper is joining You.com. Read the official announcement!

bubble sort insertion sort selection sort

Mohammed Jaseem Tp answered on November 7, 2022 Popularity 10/10 Helpfulness 1/10

answer bubble sort insertion sort selection sort

related Sorting Algorithms: Bubble, Selection, Insertion

bubble sort insertion sort selection sort

Comment

def bubbleSort(List):
    for i in range(len(List)-1):
        for j in range(len(List)-i-1):
            if List[j] > List[j+1]:
                List[j], List[j+1] = List[j+1], List[j]
    print(List)

# selection sort 
def selectionSort(list):
    for i in range(len(list)):
        min_index = i
        for j in range(i+1, len(list)):
            if list[min_index] > list[j]:
                min_index = j
        list[i], list[min_index] = list[min_index], list[i]
    print(list)

# inseartion sort
def inseartionSort(List):
    for i in range(1, len(List)):
        key = List[i]
        j = i-1
        while j>=0 and key < List[j]:
            List[j+1] = List[j]
            j -= 1
        List[j+1] = key
    print(List)

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: bubble-sort insertion-sort python selection-sort

Link to this answer
Share Copy Link

Contributed on Dec 06 2022

Mohammed Jaseem Tp

0 Answers Avg Quality 2/10

Closely Related Answers

Sorting Algorithms: Bubble, Selection, Insertion

Comment

using System;
					
public class Program
{
	public static void Main()
	{
		int[] arr = new int[] {5, 3, 7, 8, 1, 3};
		//BubbleSort(ref arr);
		//SelectionSort(ref arr);
		InsertionSort(ref arr);
		foreach(var i in arr) Console.Write(i);
	}
	public static void BubbleSort(ref int[] arr) 
	{
		for(int i=0; i<arr.Length-1; i++) 
		{
			for(int j=0; j<arr.Length-1-i; j++) 
			{
				if(arr[j]<arr[j+1]) 
				{
					//swap arr[i] and arr[i+1]
					int temp = arr[j+1];
					arr[j+1] = arr[j];
					arr[j] = temp;
				}
			}
		} 
	}
	public static void SelectionSort(ref int[] arr) 
	{
		int len = arr.Length;
		for(int i=0; i<len-1; i++)
		{
			//Find Position of Minimum number
			int posMin = i;
			for(int j=i+1; j<len; j++) 
			{
				if(arr[j]<arr[posMin]) posMin = j;
			}
			//Swap the values of start position(ith) and posMin
			int temp = arr[posMin];
			arr[posMin] = arr[i];
			arr[i] = temp;
		}
	}
	public static void InsertionSort(ref int[] arr)
	{
		for(int i=1; i<arr.Length; i++) 
		{
			int temp = arr[i];
			int j=i-1;
			while(j>=0 && temp<arr[j])
			{
				arr[j+1]=arr[j];
				j--;
			}
			arr[j+1] = temp;
		}
	}
}

Popularity 9/10 Helpfulness 1/10 Language csharp

Source: dotnetfiddle.net

Tags: c# insertion

Link to this answer
Share Copy Link

Contributed on Nov 07 2022

Md Yasir

0 Answers Avg Quality 2/10

bubble sort insertion sort selection sort

Contents

More Related Answers

bubble sort insertion sort selection sort

Closely Related Answers

Sorting Algorithms: Bubble, Selection, Insertion

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.