Java Insertion Sort

Add Answer

Ali Ladak answered on June 27, 2022 Popularity 1/10 Helpfulness 8/10

answer Java Insertion Sort

related insertion sort java

related Insertion sort in Java

related Java Insertion Sort

related install tailwind vite

Java Insertion Sort

Comment

public static int[] insertionSort(int[] arr) {
    // Loop through the array starting from the second element (index 1)
    for (int i = 1; i < arr.length; i++) {
        // 'key' is the element we want to insert into the sorted portion of the array
        int key = arr[i];
        // 'j' tracks the index of the last element in the sorted portion
        int j = i - 1;
        
        // Move elements of the sorted portion that are greater than 'key'
        // one position to the right to make space for the 'key'
        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j]; // Shift element to the right
            j--; // Move to the previous element in the sorted portion
        }
        // Insert 'key' into its correct sorted position
        arr[j + 1] = key;
    }
    // Return the sorted array
    return arr;
}

Popularity 1/10 Helpfulness 8/10 Language java

Source: Grepper

Tags: insertion-sort java

Link to this answer
Share Copy Link

Contributed on Feb 18 2025

Ali Ladak

0 Answers Avg Quality 2/10

Closely Related Answers

insertion sort java

Comment

//  Insertion Sort

class InsertionSort {
    /*Function to sort array using insertion sort*/
    void insertionsort(int arr[])
    {
        int n = arr.length;
        for (int i = 1; i < n; ++i) {
            int key = arr[i];
            int r = i - 1;
  
            /* Move elements of arr[0..i-1], that are
               greater than key, to one position ahead
               of their current position */
            while (r >= 0 && arr[r] > key) {
                arr[r + 1] = arr[r];
                r = r - 1;
            }
            arr[r + 1] = key;
        }
    }
    /* A utility function to print array of size n*/
    static void printArray(int arr[])
    {
        int n = arr.length;
        for (int i = 0; i < n; ++i)
            System.out.print(arr[i] + " ");
  
        System.out.println();
    }
  
  
    // Driver method
    public static void main(String args[])
    {
        int arr[] = { 12, 11, 13, 5, 6 , 7, 90, 60, 50, 30, 54, 2, 1, 6 };
        //creates new instance of insertin sort and runs it with a given arry
        InsertionSort ob = new InsertionSort();
        ob.insertionsort(arr);
        //prints the sorted array
        printArray(arr);
    }
}

Popularity 10/10 Helpfulness 6/10 Language java

Source: Grepper

Tags: insertion-sort inse

Link to this answer
Share Copy Link

Contributed on Oct 26 2022

An7wan

0 Answers Avg Quality 2/10

insertion sort java

Comment

// Java program for implementation of Insertion Sort
class InsertionSort {
    /*Function to sort array using insertion sort*/
    void sort(int arr[])
    {
        int n = arr.length;
        for (int i = 1; i < n; ++i) {
            int key = arr[i];
            int j = i - 1;
  
            /* Move elements of arr[0..i-1], that are
               greater than key, to one position ahead
               of their current position */
            while (j >= 0 && arr[j] > key) {
                arr[j + 1] = arr[j];
                j = j - 1;
            }
            arr[j + 1] = key;
        }
    }
  
    /* A utility function to print array of size n*/
    static void printArray(int arr[])
    {
        int n = arr.length;
        for (int i = 0; i < n; ++i)
            System.out.print(arr[i] + " ");
  
        System.out.println();
    }
  
    // Driver method
    public static void main(String args[])
    {
        int arr[] = { 12, 11, 13, 5, 6 };
  
        InsertionSort ob = new InsertionSort();
        ob.sort(arr);
  
        printArray(arr);
    }
} /* This code is contributed by Rajat Mishra. */

Popularity 9/10 Helpfulness 5/10 Language java

Source: www.geeksforgeeks.org

Tags: insertion-sort inse

Link to this answer
Share Copy Link

Contributed on Oct 12 2022

An7wan

0 Answers Avg Quality 2/10

Insertion sort in Java

Comment

// Insertion sort in Java

import java.util.Arrays;

class InsertionSort {

  void insertionSort(int array[]) {
    int size = array.length;

    for (int step = 1; step < size; step++) {
      int key = array[step];
      int j = step - 1;

      // Compare key with each element on the left of it until an element smaller than
      // it is found.
      // For descending order, change key<array[j] to key>array[j].
      while (j >= 0 && key < array[j]) {
        array[j + 1] = array[j];
        --j;
      }

      // Place key at after the element just smaller than it.
      array[j + 1] = key;
    }
  }

  // Driver code
  public static void main(String args[]) {
    int[] data = { 9, 5, 1, 4, 3 };
    InsertionSort is = new InsertionSort();
    is.insertionSort(data);
    System.out.println("Sorted Array in Ascending Order: ");
    System.out.println(Arrays.toString(data));
  }
}

Popularity 9/10 Helpfulness 3/10 Language java

Source: www.programiz.com

Tags: insertion-sort inse

Link to this answer
Share Copy Link

Contributed on Jun 27 2022

Energetic Emu

0 Answers Avg Quality 2/10

Java Insertion Sort

Comment

// Java Insertion Sort
// -------------------

/* 
   Time Complexity
     Best Time Complexity:O(n)
	 Average Time Complexity:O(n^2)
	 Worst Time Complexity:O(n^2)
     
   Space Complexity
     No auxiliary space is required in Linear Search implementation.
	 Hence space complexity is:O(1)
*/

import java.util.Arrays;
import java.util.Scanner;

public class InsertionSort {
    public static int[] sort(int arr[]) {
        for (int i = 0; i < arr.length; i++) {
            int j = i - 1; // j will point to previous element
            int k = arr[i]; // k holds the value being sorted

            while (j >= 0 && k <= arr[j]) {
                arr[j + 1] = arr[j];
                j = j - 1;
            }

            arr[j + 1] = k;

        }
        return arr; //returns the sorted array

    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int arr[] = new int[10];

        System.out.println("Enter Array Values: ");
        for (int i = 0; i < arr.length; i++) {
            arr[i] = sc.nextInt();
        }

        int a[] = new int[arr.length];

        a = Arrays.copyOf(sort(arr), arr.length); //copies the sorted array to another array

      	//sorted in ascending order
        System.out.println("Sorted Array:");
        for (int i = 0; i < a.length; i++) {
            System.out.print(+a[i] + " ");
        }
    }

}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: insertion-sort inse

Link to this answer
Share Copy Link

Contributed on Aug 20 2022

Wild Wolverine

0 Answers Avg Quality 2/10

install tailwind vite

Comment

npm install tailwindcss @tailwindcss/vite

Popularity 1/10 Helpfulness 1/10 Language shell

Source: tailwindcss.com

Tags: shell vite

Link to this answer
Share Copy Link

Contributed on Feb 16 2025

Lorenzo Satta Chiris

0 Answers Avg Quality 2/10

install tailwind vite

Comment

import { defineConfig } from 'vite'
import tailwindcss from '@tailwindcss/vite'
export default defineConfig({
  plugins: [
    tailwindcss(),
  ],
})

Popularity 2/10 Helpfulness 1/10 Language javascript

Source: tailwindcss.com

Tags: javascript vite

Link to this answer
Share Copy Link

Contributed on Feb 16 2025

Lorenzo Satta Chiris

0 Answers Avg Quality 2/10

install tailwind vite

Comment

@import "tailwindcss";

Popularity 1/10 Helpfulness 1/10 Language css

Source: tailwindcss.com

Tags: css vite

Link to this answer
Share Copy Link

Contributed on Feb 16 2025

Lorenzo Satta Chiris

0 Answers Avg Quality 2/10

install tailwind vite

Comment

<!doctype html>
<html>
<head>
  <meta charset="UTF-8">
  <meta name="viewport" content="width=device-width, initial-scale=1.0">
  <link href="/src/styles.css" rel="stylesheet">
</head>
<body>
  <h1 class="text-3xl font-bold underline">
    Hello world!
  </h1>
</body>
</html>

Popularity 1/10 Helpfulness 1/10 Language html

Source: tailwindcss.com

Tags: html vite

Link to this answer
Share Copy Link

Contributed on Feb 16 2025

Lorenzo Satta Chiris

0 Answers Avg Quality 2/10

Java Insertion Sort

Contents

More Related Answers

Java Insertion Sort

Closely Related Answers

insertion sort java

insertion sort java

Insertion sort in Java

Java Insertion Sort

install tailwind vite

install tailwind vite

install tailwind vite

install tailwind vite

Grepper

Documentation

Social

Legal

Contact

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