docs: private static <E extends Comparable<E>> int partitionDescending(E[] array, int start, int end) {
          E pivot = array[end];
          int index = start - 1;
          
          for(int j = start; j < end; j++) {
              if(array[j].compareTo(pivot) >= 0) {
                  index++;
                  TrivialSwap.swap(array, index, j);
              }
          }
          
          TrivialSwap.swap(array, index + 1, end);
          
          return index + 1;
      }