Added Median of Medians Algorithm by coderbeta1 · Pull Request #9864 · TheAlgorithms/Python

coderbeta1 · 2023-10-05T19:07:41Z

Describe your change:

Added an Algorithm: Added Median of medians algorithm to find element at rank k in time complexity O(n)

Add an algorithm?
Fix a bug or typo in an existing algorithm?
Documentation change?

Checklist:

for more information, see https://pre-commit.ci

chriso345 · 2023-10-05T22:32:20Z

+
+"""
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+32
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+2
+>>> quick_select([5, 4, 3, 2], 2)
+3
+>>> quick_select([3, 5, 7, 10, 2, 12], 3)
+5
+"""


Suggested change
"""
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 5)
32
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 1)
2
>>>quick_select([5, 4, 3, 2], 2)
3
>>>quick_select([3, 5, 7, 10, 2, 12], 3)
5
"""
There is no point in repeating the same tests here.

chriso345 · 2023-10-05T22:33:03Z

+ """
+ >>> median_of_five([2, 4, 5, 7, 899])
+ 5
+ >>> median_of_five([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_five([5, 4, 3, 2])
+ 3
+ >>> median_of_five([3, 5, 7, 10, 2])
+ 5
+ """
+ """
+ Return the median of the input list
+ :param arr: Array to find median of
+ :return: median of arr
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:47Z

+ """
+ >>> median_of_medians([2, 4, 5, 7, 899, 54, 32])
+ 54
+ >>> median_of_medians([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_medians([5, 4, 3, 2])
+ 4
+ >>> median_of_medians([3, 5, 7, 10, 2, 12])
+ 12
+ """
+ """
+ Return a pivot to partition data on by calculating
+ Median of medians of input data
+ :param arr: The data to be checked (a list)
+ :return: median of medians of input array
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:56Z

+ """
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+ 32
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+ 2
+ >>> quick_select([5, 4, 3, 2], 2)
+ 3
+ >>> quick_select([3, 5, 7, 10, 2, 12], 3)
+ 5
+ """
+
+ """
+ Two way partition the data into smaller and greater lists,
+ in relationship to the pivot
+ :param arr: The data to be searched (a list)
+ :param target: The rank to be searched
+ :return: element at rank target
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:37:23Z

+ >>> median_of_five([5, 4, 3, 2])
+ 3


This test is failing:
>>> median_of_five([5, 4, 3, 2]) Expected: 3 Got: 4

for more information, see https://pre-commit.ci

coderbeta1 · 2023-10-05T19:07:41Z

Describe your change:

Added an Algorithm: Added Median of medians algorithm to find element at rank k in time complexity O(n)

Add an algorithm?
Fix a bug or typo in an existing algorithm?
Documentation change?

Checklist:

for more information, see https://pre-commit.ci

chriso345 · 2023-10-05T22:32:20Z

+
+"""
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+32
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+2
+>>> quick_select([5, 4, 3, 2], 2)
+3
+>>> quick_select([3, 5, 7, 10, 2, 12], 3)
+5
+"""


Suggested change
"""
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 5)
32
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 1)
2
>>>quick_select([5, 4, 3, 2], 2)
3
>>>quick_select([3, 5, 7, 10, 2, 12], 3)
5
"""
There is no point in repeating the same tests here.

chriso345 · 2023-10-05T22:33:03Z

+ """
+ >>> median_of_five([2, 4, 5, 7, 899])
+ 5
+ >>> median_of_five([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_five([5, 4, 3, 2])
+ 3
+ >>> median_of_five([3, 5, 7, 10, 2])
+ 5
+ """
+ """
+ Return the median of the input list
+ :param arr: Array to find median of
+ :return: median of arr
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:47Z

+ """
+ >>> median_of_medians([2, 4, 5, 7, 899, 54, 32])
+ 54
+ >>> median_of_medians([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_medians([5, 4, 3, 2])
+ 4
+ >>> median_of_medians([3, 5, 7, 10, 2, 12])
+ 12
+ """
+ """
+ Return a pivot to partition data on by calculating
+ Median of medians of input data
+ :param arr: The data to be checked (a list)
+ :return: median of medians of input array
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:56Z

+ """
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+ 32
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+ 2
+ >>> quick_select([5, 4, 3, 2], 2)
+ 3
+ >>> quick_select([3, 5, 7, 10, 2, 12], 3)
+ 5
+ """
+
+ """
+ Two way partition the data into smaller and greater lists,
+ in relationship to the pivot
+ :param arr: The data to be searched (a list)
+ :param target: The rank to be searched
+ :return: element at rank target
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:37:23Z

+ >>> median_of_five([5, 4, 3, 2])
+ 3


This test is failing:
>>> median_of_five([5, 4, 3, 2]) Expected: 3 Got: 4

for more information, see https://pre-commit.ci

coderbeta1 · 2023-10-05T19:07:41Z

Describe your change:

Added an Algorithm: Added Median of medians algorithm to find element at rank k in time complexity O(n)

Add an algorithm?
Fix a bug or typo in an existing algorithm?
Documentation change?

Checklist:

for more information, see https://pre-commit.ci

chriso345 · 2023-10-05T22:32:20Z

+
+"""
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+32
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+2
+>>> quick_select([5, 4, 3, 2], 2)
+3
+>>> quick_select([3, 5, 7, 10, 2, 12], 3)
+5
+"""


Suggested change
"""
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 5)
32
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 1)
2
>>>quick_select([5, 4, 3, 2], 2)
3
>>>quick_select([3, 5, 7, 10, 2, 12], 3)
5
"""
There is no point in repeating the same tests here.

chriso345 · 2023-10-05T22:33:03Z

+ """
+ >>> median_of_five([2, 4, 5, 7, 899])
+ 5
+ >>> median_of_five([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_five([5, 4, 3, 2])
+ 3
+ >>> median_of_five([3, 5, 7, 10, 2])
+ 5
+ """
+ """
+ Return the median of the input list
+ :param arr: Array to find median of
+ :return: median of arr
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:47Z

+ """
+ >>> median_of_medians([2, 4, 5, 7, 899, 54, 32])
+ 54
+ >>> median_of_medians([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_medians([5, 4, 3, 2])
+ 4
+ >>> median_of_medians([3, 5, 7, 10, 2, 12])
+ 12
+ """
+ """
+ Return a pivot to partition data on by calculating
+ Median of medians of input data
+ :param arr: The data to be checked (a list)
+ :return: median of medians of input array
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:56Z

+ """
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+ 32
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+ 2
+ >>> quick_select([5, 4, 3, 2], 2)
+ 3
+ >>> quick_select([3, 5, 7, 10, 2, 12], 3)
+ 5
+ """
+
+ """
+ Two way partition the data into smaller and greater lists,
+ in relationship to the pivot
+ :param arr: The data to be searched (a list)
+ :param target: The rank to be searched
+ :return: element at rank target
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:37:23Z

+ >>> median_of_five([5, 4, 3, 2])
+ 3


This test is failing:
>>> median_of_five([5, 4, 3, 2]) Expected: 3 Got: 4

for more information, see https://pre-commit.ci

coderbeta1 · 2023-10-05T19:07:41Z

Describe your change:

Added an Algorithm: Added Median of medians algorithm to find element at rank k in time complexity O(n)

Add an algorithm?
Fix a bug or typo in an existing algorithm?
Documentation change?

Checklist:

for more information, see https://pre-commit.ci

chriso345 · 2023-10-05T22:32:20Z

+
+"""
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+32
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+2
+>>> quick_select([5, 4, 3, 2], 2)
+3
+>>> quick_select([3, 5, 7, 10, 2, 12], 3)
+5
+"""


Suggested change
"""
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 5)
32
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 1)
2
>>>quick_select([5, 4, 3, 2], 2)
3
>>>quick_select([3, 5, 7, 10, 2, 12], 3)
5
"""
There is no point in repeating the same tests here.

chriso345 · 2023-10-05T22:33:03Z

+ """
+ >>> median_of_five([2, 4, 5, 7, 899])
+ 5
+ >>> median_of_five([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_five([5, 4, 3, 2])
+ 3
+ >>> median_of_five([3, 5, 7, 10, 2])
+ 5
+ """
+ """
+ Return the median of the input list
+ :param arr: Array to find median of
+ :return: median of arr
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:47Z

+ """
+ >>> median_of_medians([2, 4, 5, 7, 899, 54, 32])
+ 54
+ >>> median_of_medians([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_medians([5, 4, 3, 2])
+ 4
+ >>> median_of_medians([3, 5, 7, 10, 2, 12])
+ 12
+ """
+ """
+ Return a pivot to partition data on by calculating
+ Median of medians of input data
+ :param arr: The data to be checked (a list)
+ :return: median of medians of input array
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:56Z

+ """
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+ 32
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+ 2
+ >>> quick_select([5, 4, 3, 2], 2)
+ 3
+ >>> quick_select([3, 5, 7, 10, 2, 12], 3)
+ 5
+ """
+
+ """
+ Two way partition the data into smaller and greater lists,
+ in relationship to the pivot
+ :param arr: The data to be searched (a list)
+ :param target: The rank to be searched
+ :return: element at rank target
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:37:23Z

+ >>> median_of_five([5, 4, 3, 2])
+ 3


This test is failing:
>>> median_of_five([5, 4, 3, 2]) Expected: 3 Got: 4

for more information, see https://pre-commit.ci

coderbeta1 · 2023-10-05T19:07:41Z

Describe your change:

Added an Algorithm: Added Median of medians algorithm to find element at rank k in time complexity O(n)

Add an algorithm?
Fix a bug or typo in an existing algorithm?
Documentation change?

Checklist:

for more information, see https://pre-commit.ci

chriso345 · 2023-10-05T22:32:20Z

+
+"""
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+32
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+2
+>>> quick_select([5, 4, 3, 2], 2)
+3
+>>> quick_select([3, 5, 7, 10, 2, 12], 3)
+5
+"""


Suggested change
"""
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 5)
32
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 1)
2
>>>quick_select([5, 4, 3, 2], 2)
3
>>>quick_select([3, 5, 7, 10, 2, 12], 3)
5
"""
There is no point in repeating the same tests here.

chriso345 · 2023-10-05T22:33:03Z

+ """
+ >>> median_of_five([2, 4, 5, 7, 899])
+ 5
+ >>> median_of_five([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_five([5, 4, 3, 2])
+ 3
+ >>> median_of_five([3, 5, 7, 10, 2])
+ 5
+ """
+ """
+ Return the median of the input list
+ :param arr: Array to find median of
+ :return: median of arr
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:47Z

+ """
+ >>> median_of_medians([2, 4, 5, 7, 899, 54, 32])
+ 54
+ >>> median_of_medians([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_medians([5, 4, 3, 2])
+ 4
+ >>> median_of_medians([3, 5, 7, 10, 2, 12])
+ 12
+ """
+ """
+ Return a pivot to partition data on by calculating
+ Median of medians of input data
+ :param arr: The data to be checked (a list)
+ :return: median of medians of input array
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:56Z

+ """
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+ 32
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+ 2
+ >>> quick_select([5, 4, 3, 2], 2)
+ 3
+ >>> quick_select([3, 5, 7, 10, 2, 12], 3)
+ 5
+ """
+
+ """
+ Two way partition the data into smaller and greater lists,
+ in relationship to the pivot
+ :param arr: The data to be searched (a list)
+ :param target: The rank to be searched
+ :return: element at rank target
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:37:23Z

+ >>> median_of_five([5, 4, 3, 2])
+ 3


This test is failing:
>>> median_of_five([5, 4, 3, 2]) Expected: 3 Got: 4

for more information, see https://pre-commit.ci

coderbeta1 · 2023-10-05T19:07:41Z

Describe your change:

Added an Algorithm: Added Median of medians algorithm to find element at rank k in time complexity O(n)

Add an algorithm?
Fix a bug or typo in an existing algorithm?
Documentation change?

Checklist:

for more information, see https://pre-commit.ci

chriso345 · 2023-10-05T22:32:20Z

+
+"""
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+32
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+2
+>>> quick_select([5, 4, 3, 2], 2)
+3
+>>> quick_select([3, 5, 7, 10, 2, 12], 3)
+5
+"""


Suggested change
"""
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 5)
32
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 1)
2
>>>quick_select([5, 4, 3, 2], 2)
3
>>>quick_select([3, 5, 7, 10, 2, 12], 3)
5
"""
There is no point in repeating the same tests here.

chriso345 · 2023-10-05T22:33:03Z

+ """
+ >>> median_of_five([2, 4, 5, 7, 899])
+ 5
+ >>> median_of_five([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_five([5, 4, 3, 2])
+ 3
+ >>> median_of_five([3, 5, 7, 10, 2])
+ 5
+ """
+ """
+ Return the median of the input list
+ :param arr: Array to find median of
+ :return: median of arr
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:47Z

+ """
+ >>> median_of_medians([2, 4, 5, 7, 899, 54, 32])
+ 54
+ >>> median_of_medians([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_medians([5, 4, 3, 2])
+ 4
+ >>> median_of_medians([3, 5, 7, 10, 2, 12])
+ 12
+ """
+ """
+ Return a pivot to partition data on by calculating
+ Median of medians of input data
+ :param arr: The data to be checked (a list)
+ :return: median of medians of input array
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:56Z

+ """
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+ 32
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+ 2
+ >>> quick_select([5, 4, 3, 2], 2)
+ 3
+ >>> quick_select([3, 5, 7, 10, 2, 12], 3)
+ 5
+ """
+
+ """
+ Two way partition the data into smaller and greater lists,
+ in relationship to the pivot
+ :param arr: The data to be searched (a list)
+ :param target: The rank to be searched
+ :return: element at rank target
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:37:23Z

+ >>> median_of_five([5, 4, 3, 2])
+ 3


This test is failing:
>>> median_of_five([5, 4, 3, 2]) Expected: 3 Got: 4

for more information, see https://pre-commit.ci

coderbeta1 · 2023-10-05T19:07:41Z

Describe your change:

Added an Algorithm: Added Median of medians algorithm to find element at rank k in time complexity O(n)

Add an algorithm?
Fix a bug or typo in an existing algorithm?
Documentation change?

Checklist:

for more information, see https://pre-commit.ci

chriso345 · 2023-10-05T22:32:20Z

+
+"""
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+32
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+2
+>>> quick_select([5, 4, 3, 2], 2)
+3
+>>> quick_select([3, 5, 7, 10, 2, 12], 3)
+5
+"""


Suggested change
"""
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 5)
32
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 1)
2
>>>quick_select([5, 4, 3, 2], 2)
3
>>>quick_select([3, 5, 7, 10, 2, 12], 3)
5
"""
There is no point in repeating the same tests here.

chriso345 · 2023-10-05T22:33:03Z

+ """
+ >>> median_of_five([2, 4, 5, 7, 899])
+ 5
+ >>> median_of_five([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_five([5, 4, 3, 2])
+ 3
+ >>> median_of_five([3, 5, 7, 10, 2])
+ 5
+ """
+ """
+ Return the median of the input list
+ :param arr: Array to find median of
+ :return: median of arr
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:47Z

+ """
+ >>> median_of_medians([2, 4, 5, 7, 899, 54, 32])
+ 54
+ >>> median_of_medians([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_medians([5, 4, 3, 2])
+ 4
+ >>> median_of_medians([3, 5, 7, 10, 2, 12])
+ 12
+ """
+ """
+ Return a pivot to partition data on by calculating
+ Median of medians of input data
+ :param arr: The data to be checked (a list)
+ :return: median of medians of input array
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:56Z

+ """
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+ 32
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+ 2
+ >>> quick_select([5, 4, 3, 2], 2)
+ 3
+ >>> quick_select([3, 5, 7, 10, 2, 12], 3)
+ 5
+ """
+
+ """
+ Two way partition the data into smaller and greater lists,
+ in relationship to the pivot
+ :param arr: The data to be searched (a list)
+ :param target: The rank to be searched
+ :return: element at rank target
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:37:23Z

+ >>> median_of_five([5, 4, 3, 2])
+ 3


This test is failing:
>>> median_of_five([5, 4, 3, 2]) Expected: 3 Got: 4

for more information, see https://pre-commit.ci

coderbeta1 · 2023-10-05T19:07:41Z

Describe your change:

Added an Algorithm: Added Median of medians algorithm to find element at rank k in time complexity O(n)

Add an algorithm?
Fix a bug or typo in an existing algorithm?
Documentation change?

Checklist:

for more information, see https://pre-commit.ci

chriso345 · 2023-10-05T22:32:20Z

+
+"""
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+32
+>>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+2
+>>> quick_select([5, 4, 3, 2], 2)
+3
+>>> quick_select([3, 5, 7, 10, 2, 12], 3)
+5
+"""


Suggested change
"""
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 5)
32
>>>quick_select([2, 4, 5, 7, 899, 54, 32], 1)
2
>>>quick_select([5, 4, 3, 2], 2)
3
>>>quick_select([3, 5, 7, 10, 2, 12], 3)
5
"""
There is no point in repeating the same tests here.

chriso345 · 2023-10-05T22:33:03Z

+ """
+ >>> median_of_five([2, 4, 5, 7, 899])
+ 5
+ >>> median_of_five([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_five([5, 4, 3, 2])
+ 3
+ >>> median_of_five([3, 5, 7, 10, 2])
+ 5
+ """
+ """
+ Return the median of the input list
+ :param arr: Array to find median of
+ :return: median of arr
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:47Z

+ """
+ >>> median_of_medians([2, 4, 5, 7, 899, 54, 32])
+ 54
+ >>> median_of_medians([5, 7, 899, 54, 32])
+ 32
+ >>> median_of_medians([5, 4, 3, 2])
+ 4
+ >>> median_of_medians([3, 5, 7, 10, 2, 12])
+ 12
+ """
+ """
+ Return a pivot to partition data on by calculating
+ Median of medians of input data
+ :param arr: The data to be checked (a list)
+ :return: median of medians of input array
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:33:56Z

+ """
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 5)
+ 32
+ >>> quick_select([2, 4, 5, 7, 899, 54, 32], 1)
+ 2
+ >>> quick_select([5, 4, 3, 2], 2)
+ 3
+ >>> quick_select([3, 5, 7, 10, 2, 12], 3)
+ 5
+ """
+
+ """
+ Two way partition the data into smaller and greater lists,
+ in relationship to the pivot
+ :param arr: The data to be searched (a list)
+ :param target: The rank to be searched
+ :return: element at rank target
+ """


Can you swap the order of the tests and explanation, and condense into a single docstring

chriso345 · 2023-10-05T22:37:23Z

+ >>> median_of_five([5, 4, 3, 2])
+ 3


This test is failing:
>>> median_of_five([5, 4, 3, 2]) Expected: 3 Got: 4

for more information, see https://pre-commit.ci

Added Median of Medians Algorithm
82a8273

algorithms-keeperBot added the awaiting reviews This PR is ready to be reviewed label Oct 5, 2023

[pre-commit.ci] auto fixes from pre-commit.com hooks
68a3fdb
for more information, see https://pre-commit.ci

algorithms-keeperBot added the tests are failing Do not merge until tests pass label Oct 5, 2023

chriso345 requested changes Oct 5, 2023
View reviewed changes

chriso345 reviewed Oct 5, 2023
View reviewed changes

coderbeta1and others added 3 commits October 6, 2023 08:19

Update median_of_medians.py as per requested changes
c767c66

Merge branch 'TheAlgorithms:master' into mediansAlgo
016dabb

[pre-commit.ci] auto fixes from pre-commit.com hooks
328a2df
for more information, see https://pre-commit.ci

algorithms-keeperBot removed the tests are failing Do not merge until tests pass label Oct 6, 2023

coderbeta1 requested a review from chriso345 October 6, 2023 12:34

chriso345 approved these changes Oct 8, 2023
View reviewed changes

chriso345 merged commit 17de908 into TheAlgorithms:masterOct 8, 2023

algorithms-keeperBot removed the awaiting reviews This PR is ready to be reviewed label Oct 8, 2023

isidroas mentioned this pull request Jan 25, 2025
dh isidroas/Python#1
Closed
14 tasks