Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Java Insertion Sort but make it read the data 12, 11, 13, 5, 6 from a file not an array   // Java program for implementation of Insertion Sort public 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 }; // make it read from a file instead of having this           InsertionSort ob = new InsertionSort();         ob.sort(arr);           printArray

Java Insertion Sort but make it read the data 12, 11, 13, 5, 6 from a file not an array   // Java program for implementation of Insertion Sort public 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 }; // make it read from a file instead of having this           InsertionSort ob = new InsertionSort();         ob.sort(arr);           printArray

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%

Java Insertion Sort but make it read the data 12, 11, 13, 5, 6 from a file not an array

 
// Java program for implementation of Insertion Sort
public 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 }; // make it read from a file instead of having this
 
        InsertionSort ob = new InsertionSort();
        ob.sort(arr);
 
        printArray(arr);
    }
};
 
 
/* This code is contributed by Rajat Mishra. */
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Recurrence Relation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS