Question

import java.util.ArrayList;
import java.util.Set;

public class Project {

/*
   * Input is sorted (ascending) to within k positions i.e. each value in the
   * array is within k positions of where it should be.
   * For example:
   * k=1 input=[2, 1, 3, 4, 5]
   * k=2 input=[3, 2, 1, 4, 5]
   * k=3 input=[4, 2, 3, 1, 5]
   * More than one element might be off by k! For example:
   * k=2 input = [2, 3, 1, 5, 4]
   *
   * Return a sorted list. Using extra storage is ok. Making another array to
   * return is also ok.
   */
   public int[] sortaSorted(int[] input, int k) {
       int[] result = new int[input.length];
       return result;
   }
}

Answer 1

Solution:

 public class Project {     public int[] sortaSorted(int[] input, int k) {                          for(int index = 1; index < input.length; index++) {                  int counter = k;                        int currIndex = index;                  while(currIndex > 0 && counter > 0 && input[currIndex] < input[currIndex - 1]) {                               int temp = input[currIndex];                            input[currIndex] = input[currIndex - 1];                                input[currIndex - 1] = temp;                            currIndex--;                            counter--;                      }               }                               return input;   }               public static void main(String args[]) {                int input[] = {2, 3, 1, 5, 4};                          Project project = new Project();                int output[] = project.sortaSorted(input, 2);           for(int element: output)                        System.out.print(element + " ");        } } 

Note: The main method has been added just to test the sortaSorted() method. (Bubble Sorting technique used)

Screenshot for reference:

1 public class Project { public int[] sortaSorted (int[] input, int k) { for(int index = 1; index < input.length; index++) { int counter = k; int currIndex = index; while(currIndex > 0 && counter > 0 && input[currIndex] < input[currIndex - 1]) { int temp = input[currIndex]; input[currIndex] = input[currIndex - 1]; input[curr Index - 1] = temp; curr Index--; counter--; 13 16 return input; 18 19 200 21 public static void main(String args[]) { int input[] = {2, 3, 1, 5, 4}; 24 Project project = new Project(); int output[] = project.sortaSorted (input, 2); for(int element: output) System.out.print(element + " "); 26 27 28 }