com.sl.algorithms.search.median

Class BruteForceMedianFinder<T extends java.lang.Comparable>

java.lang.Object

com.sl.algorithms.search.median.BruteForceMedianFinder<T>

All Implemented Interfaces:

BaseInterface<T>, Constants, MedianFinder<T>, QuickSelect<T>

public class BruteForceMedianFinder<T extends java.lang.Comparable>
extends java.lang.Object
implements MedianFinder<T>

Brute-force solution, for reference only.

Time : O(N logN)
Space: O(N)

Field Summary

Fields inherited from interface com.sl.algorithms.core.interfaces.base.Constants

ARRAY_IS_EMPTY, DATA_TYPE_NOT_SUPPORTED_YET, DECIMAL_RADIX, DELIMITER_COMMA, ELEMENT_NOT_FOUND, LIST_IS_EMPTY, OPERATION_NOT_SUPPORTED_YET

Constructor Summary

Constructors

Constructor and Description
BruteForceMedianFinder()

Method Summary

Modifier and Type	Method and Description
T	findKthSmallest(T[] objects, int k) QuickSelect based default implementation for findKthSmallest problem.

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.sl.algorithms.core.interfaces.select.MedianFinder

findMaximum, findMedian, findMinimum

Methods inherited from interface com.sl.algorithms.core.interfaces.select.QuickSelect

findKthLargest, kCheck, medianOf3, pivotSort, quickSelect

Methods inherited from interface com.sl.algorithms.core.interfaces.base.BaseInterface

checkArray, checkIntArray, checkList

Constructor Detail

BruteForceMedianFinder

public BruteForceMedianFinder()

Method Detail

findKthSmallest

public T findKthSmallest(T[] objects,
                         int k)

Description copied from interface: QuickSelect

QuickSelect based default implementation for findKthSmallest problem.

Specified by:

findKthSmallest in interface QuickSelect<T extends java.lang.Comparable>

Parameters:

objects - input array

k - 3rd smallest = 3, when objects:[1,2,3,4,5] and k=3

Returns:

kth smallest element in objects