Translate the code below to JavaSolutionimport javautil impo

Translate the code below to Java

Solution

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

class Quicksort
{
   public static int INPUT_SIZE = 10;

// A simple print function
public static void print(int input[])
{
for ( int i = 0; i < INPUT_SIZE; i++ )
System.out.println(input[i] +\" \");
System.out.println();
}

// The partition function
public static int partition(int input[], int p, int r)
{
int pivot = input[r];

while ( p < r )
{
while ( input[p] < pivot )
p++;

while ( input[r] > pivot )
r--;

if ( input[p] == input[r] )
p++;
else if ( p < r )
{
int tmp = input[p];
input[p] = input[r];
input[r] = tmp;
}
}

return r;
}

// The quicksort recursive function
public static void quicksort(int input[], int p, int r)
{
if ( p < r )
{
int j = partition(input, p, r);
quicksort(input, p, j-1);
quicksort(input, j+1, r);
}
}

public static void main (String[] args)
   {
  
   int input[] = {500, 700, 800, 100, 300, 200, 900, 400, 1000, 600};
System.out.println(\"Input: \");
print(input);
quicksort(input, 0, 9);
System.out.println(\"Output: \");
print(input);
   }
}

Output:

Success time: 0.05 memory: 711168 signal:0