Question

I need to write a program in java that reads a text file with a list of numbers and sorts them from least to greatest. This is the starter file.

import java.util.*;

import java.io.*;

public class Lab3

{

static final int INITIAL_CAPACITY = 5;

public static void main( String args[] ) throws Exception

{

// ALWAYS TEST FOR REQUIRED INPUT FILE NAME ON THE COMMAND LINE

if (args.length < 1 )

{

System.out.println("\nusage: C:\\> java Lab3 L3input.txt\n");

System.exit(0);

}

// LOAD FILE INTO ARR USING INSERINORDER

Scanner infile = new Scanner( new File( args[0] ) );

int[] arr = new int[INITIAL_CAPACITY];

int count= 0;

while (infile.hasNextInt())

{

if ( count == arr.length ) arr = upSize( arr );

insertInOrder( arr, count, infile.nextInt() );

++count; // WE JUST ADDED A VALUE - UP THE COUNT

}

infile.close();

printArray( "SORTED ARRAY: ", arr, count );

} // END MAIN

// ################################################################

// USE AS IS - DO NOT MODIFY

static void printArray( String caption, int[] arr, int count )

{

System.out.print( caption );

for( int i=0 ; i<count ;++i )

System.out.print(arr[i] + " " );

System.out.println();

}

// YOU WRITE THIS METHOD - DO NOT MODIFY THIS FILE ANYWHERE ELSE

// ################################################################

static void insertInOrder( int[] arr, int count, int key )

{

}

static int[] upSize( int[] fullArr )

{

int l = fullArr.length * 2;

// CHANGE TO YOUR RETURN STATEMENT

}

} // END LAB3

Answer 1

import java.util.*;
import java.io.*;

public class Lab3
{
static final int INITIAL_CAPACITY = 5;

public static void main( String args[] ) throws Exception
{
// ALWAYS TEST FOR REQUIRED INPUT FILE NAME ON THE COMMAND LINE
if (args.length < 1 )
{
System.out.println("\nusage: C:\\> java Lab3 L3input.txt\n");
System.exit(0);
}
// LOAD FILE INTO ARR USING INSERINORDER

Scanner infile = new Scanner( new File( args[0] ) );
int[] arr = new int[INITIAL_CAPACITY];
int count= 0;
while (infile.hasNextInt())
{
if ( count == arr.length ) arr = upSize( arr );
insertInOrder( arr, count, infile.nextInt() );
++count; // WE JUST ADDED A VALUE - UP THE COUNT
}
infile.close();
printArray( "SORTED ARRAY: ", arr, count++ );

} // END MAIN
// ################################################################

// USE AS IS - DO NOT MODIFY
static void printArray( String caption, int[] arr, int count )
{
System.out.print( caption );
for( int i=0 ; i<count ;++i )
System.out.print(arr[i] + " " );
System.out.println();
}

// YOU WRITE THIS METHOD - DO NOT MODIFY THIS FILE ANYWHERE ELSE
// ################################################################
static void insertInOrder( int[] arr, int count, int key )
{

int flag=0;
for(int i=0;i<count;i++){
if(arr[i]>key){
int temp1=arr[i];
int temp2;
for(int j=i;j<count;j++){
temp2=arr[j+1];
arr[j+1]=temp1;
temp1=temp2;
  
}
arr[i]=key;
flag=1;
break;
}
}
if(flag == 0){
arr[count] = key;
}
}
static int[] upSize( int[] fullArr )
{
int l = fullArr.length * 2;
int[] modArr =new int[l];
for(int i=0;i<fullArr.length;i++){
modArr[i]=fullArr[i];
}
// CHANGE TO YOUR RETURN STATEMENT
return modArr;
}
} // END LAB3

OUTPUT: