static void swap(int[] arr, int i, int j){
          int temp = arr[i];
          arr[i] = arr[j];
          arr[j] = temp;
      }
      static int partition(int[] arr, int low, int high){
          int pivot = arr[high];
          int i = (low - 1);
        
          for(int j = low; j <= high - 1; j++)
          {
              if (arr[j] < pivot){
                  i++;
                  swap(arr, i, j);
              }
          }
          swap(arr, i + 1, high);
          return (i + 1);
      }
        
      static void quickSort(int[] arr, int low, int high){
          if (low < high)
          {
              int pi = partition(arr, low, high);
              quickSort(arr, low, pi - 1);
              quickSort(arr, pi + 1, high);
          }
      }

      Java language logo
      Quick Sort

      Axt

      The quickSort function sorts the entire array in place using a quicksort algorithm.

      0 Comments

        Add Comment

        Log in to add a comment

        Codiga - All rights reserved 2022.