Assignment No6
Assignment No6
import java.util.Random;
return;
else
swap(pivotIndex, right);
QuickSort(partition + 1, right);
printSequence(sequence);
}
}
while (true)
break;
else
swap(leftPtr, rightPtr);
swap(leftPtr, right);
return leftPtr;
sequence[dex1] = sequence[dex2];
sequence[dex2] = temp;
{
System.out.println();
for (int i = 0; i < sorted_sequence.length; i++)
sequence[i] = Math.abs(random.nextInt(100));
printSequence(sequence);
QuickSort(0, N - 1);
printSequence(sequence);