Class Quicksort

java.lang.Object
topics.sorting.Quicksort
All Implemented Interfaces:
ISortingAlgorithm
public class Quicksort extends Object implements ISortingAlgorithm
Quicksort sorting algorithm. Uses divide-and-conquer with median-of-three pivot selection. Average and best-case complexity is O(n log n), worst case is O(n^2).
Author:
vicegd

  • Constructor Summary

    Constructors
    Constructor
    Description
    Quicksort()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    void
    sort(int[] elements)
    Sorts elements without tracing anything
    void
    sort(int[] elements, boolean trace)
    Sorts elements with the possibility of tracing the operation

    Methods inherited from class Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Quicksort

      public Quicksort()

  • Method Details

    • sort

      public void sort(int[] elements)
      Description copied from interface: ISortingAlgorithm
      Sorts elements without tracing anything
      Specified by:
      sort in interface ISortingAlgorithm
      Parameters:
      elements - Array of numbers to be sorted

    • sort

      public void sort(int[] elements, boolean trace)
      Description copied from interface: ISortingAlgorithm
      Sorts elements with the possibility of tracing the operation
      Specified by:
      sort in interface ISortingAlgorithm
      Parameters:
      elements - Array of numbers to be sorted
      trace - Whether to trace the operation performed