Guest User

Untitled

a guest
Dec 18th, 2017
68
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.03 KB | None | 0 0
  1. class QuickSort{
  2. public void quicksort(int[] arr, int start, int stop){
  3. if(start < stop){
  4. int left = start;
  5. int right = stop;
  6. int pivot = arr[start];
  7.  
  8. while(arr[left] < pivot){
  9. left += 1;
  10. }
  11.  
  12. while(arr[right] > pivot){
  13. right -= 1;
  14. }
  15.  
  16. if(left <= right){
  17. int temp = arr[left];
  18. arr[left] = arr[right];
  19. arr[right] = temp;
  20. left += 1;
  21. right -= 1;
  22. }
  23.  
  24. quicksort(arr, start, right);
  25. quicksort(arr, left, stop);
  26. }
  27. }
  28. }
  29.  
  30. public class Test{
  31. public static void main(String[] args){
  32. QuickSort ob = new QuickSort();
  33. int[] arr = {5, 2, 3, 4, 1};
  34. int n = arr.length;
  35. ob.quicksort(arr, 0, n-1);
  36. System.out.println("After sorting");
  37. for(int i = 0; i < n; i++){
  38. System.out.print(arr[i] + " ");
  39. }
  40. System.out.println();
  41. }
  42. }
Add Comment
Please, Sign In to add comment