Question

Tried numerous times but I think I'm doing this problem wrong. Will give thumb's up for help.

(5) (40 points) For the purposes of this problem, we wll say that a list of integers is k-close to sorted if every integer is at most k indices away from the index it would be in in a sorted list. In this problem, you will write a program that takes in a list of integers that is k-close to sorted and out- puts the sorted list. ("Sorted" refers to being sorted in ascending order for this problem.) Input will be given as an integer k on its own line, followed by a space- separated list of integers. Your program should output the sorted list. For example, if you are given the following input 3 2 16457 9 8 12 10 11 then you should print 1 2 3 4567 8 9 10 11 12 The code for reading input and writing output has been provided in the ArraySorter class; your job is to implement the sort ) method. Restrictions: In this problem, your program must have a runtime in O(n log(k)) where n is the length of the list and k is the maximum distance between a number's original position and its position in the sorted list. Less efficient answers will receive at most 1/2 credit for this problem. In particular, algorithms with a runtime in Θ(n log(n)) do not take full advantage of the fact that the list is k-close to sorted. and thus do not represent a complete solution to this problem. » Any data structures and/or algorithms you implement must not, for example, use Java's PriorityQueue class or any library sorting methods Answers that use any of Java's data structures other than arrays will be implemented by you; you may

JAVA starter code:

import java.util.Scanner;

public class ArraySorter {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
  
// Read in k, which represents the maximum
// distance between a number's current position
// and sorted position
int k = Integer.parseInt(sc.nextLine());
  
// Read in the list of numbers
int[] numbers;
String input = sc.nextLine();
if (input.equals("")) {
numbers = new int[0];
} else {
String[] numberStrings = input.split(" ");
numbers = new int[numberStrings.length];
for (int i = 0; i < numberStrings.length; i++) {
numbers[i] = Integer.parseInt(numberStrings[i]);
}
}

// Sort the list
sort(numbers, k);

// Print the sorted list
StringBuilder resultSb = new StringBuilder();
for (int i = 0; i < numbers.length; i++) {
resultSb.append(new Integer(numbers[i]).toString());
if (i < numbers.length - 1) {
resultSb.append(" ");
}
}
System.out.println(resultSb.toString());
}
  
public static void sort(int[] numbers, int k) {
// TODO implement this function
throw new UnsupportedOperationException();
}
}

Answer 1

import java.util.Scanner;

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

       // Read in k, which represents the maximum
       // distance between a number's current position
       // and sorted position
       System.out.println("Enter k ");
       int k = Integer.parseInt(sc.nextLine());

       // Read in the list of numbers
       System.out.println("Enter numbers seperated by spaces ");
       int[] numbers;
       String input = sc.nextLine();
       if (input.equals("")) {
           numbers = new int[0];
       } else {
           String[] numberStrings = input.split(" ");
           numbers = new int[numberStrings.length];
           for (int i = 0; i < numberStrings.length; i++) {
               numbers[i] = Integer.parseInt(numberStrings[i]);
           }
       }

       // Sort the list
       sort(numbers, k);

       // Print the sorted list
       StringBuilder resultSb = new StringBuilder();
       for (int i = 0; i < numbers.length; i++) {
           resultSb.append(new Integer(numbers[i]).toString());
           if (i < numbers.length - 1) {
               resultSb.append(" ");
           }
       }
       System.out.println("The sorted list is : " + resultSb.toString());
   }

   public static void sort(int[] numbers, int k) {
       int[] heapArray = new int[k + 1];
       for (int i = 0; i <= k && i < numbers.length; i++)
           heapArray[i] = numbers[i];
       Minheap minHeap = new Minheap(heapArray, k + 1);

       for (int i = k + 1, j = 0; j < numbers.length; i++, j++) {

           if (i < numbers.length)
               numbers[j] = minHeap.replaceMinimumElement(numbers[i]);
           else
               numbers[j] = minHeap.extractMinimumElement();
       }
   }

static class Minheap {
   int[] heapArray;
   int heapSize;

   // Constructor
   Minheap(int array[], int size) {
       heapArray = array;
       heapSize = size;
       int i = (heapSize - 1) / 2;
       while (i >= 0) {
           MinHeapify(i);
           i--;
       }
   }

   // function to heapify a tree
   void MinHeapify(int root) {
       int leftChild = getLeftChild(root);
       int rightChild = getRightChild(root);
       int smallestChild = root;
       if (leftChild < heapSize && heapArray[leftChild] < heapArray[root])
           smallestChild = leftChild;
       if (rightChild < heapSize && heapArray[rightChild] < heapArray[smallestChild])
           smallestChild = rightChild;
       if (smallestChild != root) {
           int temp = heapArray[root];
           heapArray[root] = heapArray[smallestChild];
           heapArray[smallestChild] = temp;
           MinHeapify(smallestChild);
       }
   }

   // helper function to get index of left child
   int getLeftChild(int i) {
       return (2 * i + 1);
   }

   // helper function to to get index of right child
   int getRightChild(int i) {
       return (2 * i + 2);
   }

   // function to replace minimum element with x
   int replaceMinimumElement(int x) {
       int root = heapArray[0];
       heapArray[0] = x;
       if (root < x)
           MinHeapify(0);
       return root;
   }

   // function to extract minimum element and heapify again
   int extractMinimumElement() {
       int root = heapArray[0];
       if (heapSize > 1) {
           heapArray[0] = heapArray[heapSize - 1];
           heapSize--;
           MinHeapify(0);
       }
       return root;
   }
}

}

// Output

Enter k Enter numbers seperated by spaces 20 60 30 120 560 80 The sorted list is : 6 20 30 80 120 560