# Package de.caff.generics.algorithm

Useful algorithms.

See: Description

- Class Summary
  Class | Description
  --- | ---
  DualPivotQuicksort | This class implements the Dual-Pivot Quicksort algorithm by Vladimir Yaroslavskiy, Jon Bentley, and Josh Bloch.
  FastByteSequenceSearch | Fast search algorithm in sequences of random-accessible byte values.
  FastCharSequenceSearch | Fast search algorithm in sequences of random-accessible char values.
  FastDoubleSequenceSearch | Fast search algorithm in sequences of random-accessible double values.
  FastFloatSequenceSearch | Fast search algorithm in sequences of random-accessible float values.
  FastIntSequenceSearch | Fast search algorithm in sequences of random-accessible integers.
  FastLongSequenceSearch | Fast search algorithm in sequences of random-accessible long values.
  FastSequenceSearch<T> | Fast search algorithm in sequences of random-accessible values.
  FastSequentialSearch | Deprecated use `FastIntSequenceSearch` instead
  FastShortSequenceSearch | Fast search algorithm in sequences of random-accessible short values.
  FastSortByte | A non-stable sort algorithm for byte arrays which is much faster compared to TimSort.
  FastSortChar | A sort algorithm for byte arrays which is much faster compared to TimSort.
  TimSort<T> | TimSort is an advanced stable sorting algorithm developed by Tim Peters.
  TimSortDouble | TimSort for primitive doubles.
  TimSortFloat | TimSort for primitive floats.
  TimSortInt | TimSort for primitive ints.
  TimSortLong | TimSort for primitive longs.

## Package de.caff.generics.algorithm Description

Useful algorithms.

Currently only provides algorithms for fast searching short sequences in longer sequences, both represented by indexables.