Scribd Logo
Upload

Welcome to Scribd!

  • Insertion Sort

    Uploaded by

    mervin_quinto
    7 views1 page
    This Java code defines an insertion sort algorithm that sorts an array of characters. It iterates through the array from the second element to the last, compares each element to those before it, and swaps elements into sorted position by shifting larger elements to the right until the current element is in the correct place.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This Java code defines an insertion sort algorithm that sorts an array of characters. It iterates through the array from the second element to the last, compares each element to those before it, and swaps elements into sorted position by shifting larger elements to the right until the current element is in the correct place.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views1 page

    Insertion Sort

    Uploaded by

    mervin_quinto
    This Java code defines an insertion sort algorithm that sorts an array of characters. It iterates through the array from the second element to the last, compares each element to those before it, and swaps elements into sorted position by shifting larger elements to the right until the current element is in the correct place.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    public class InsertionSort {

    public static void insertionSort(char[] a) { int n = a.length; for (int i=1; i<n; i++) { char cur = a[i]; int j=i-1; while((j>=0) && (a[j]>cur)) { a[j+1] = a[j--]; a[j+1]=cur; } } }

    You might also like