mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
* added laplacian_filter file * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * updated laplacian.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * updated laplacian_py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * updated laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * updated laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * updated laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * required changes to laplacian file * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * changed laplacian_filter.py * changed laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * changed laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * changed laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * updated laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * update laplacian_filter.py * update laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * update laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * changed laplacian_filter.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * changed laplacian_filter.py * changed laplacian_filter.py * changed laplacian_filter.py * add matrix_multiplication.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * update matrix_multiplication * update matrix_multiplication * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * make changes * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * update * update * updates * resolve conflict * add doctest * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * make changes * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * update laplacian.py * add doctests * more doctest added * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * try to resolve ruff error * try to reslve ruff error * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * update doctest * attemp - resolve ruff error * resolve build error * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * resolve build issue * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * update build * doctest update * update doctest * update doctest * update doctest * fix ruff error * file location changed * Delete digital_image_processing/filters/laplacian_filter.py * Create laplacian_filter.py * Update matrix_multiplication_recursion.py * Update matrix_multiplication_recursion.py * Update matrix_multiplication_recursion.py * Update matrix_multiplication_recursion.py * Update matrix_multiplication_recursion.py * Add doctest to median_of_3 * add doctest to median_of_3 function * Update intro_sort.py * Update sorts/intro_sort.py --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
ojas wani
GitHub
parent
5019561681
commit
bad39cd154
|
|
@ -1,5 +1,5 @@
|
|||
"""
|
||||
Introspective Sort is hybrid sort (Quick Sort + Heap Sort + Insertion Sort)
|
||||
Introspective Sort is a hybrid sort (Quick Sort + Heap Sort + Insertion Sort)
|
||||
if the size of the list is under 16, use insertion sort
|
||||
https://en.wikipedia.org/wiki/Introsort
|
||||
"""
|
||||
|
|
@ -9,7 +9,6 @@ import math
|
|||
def insertion_sort(array: list, start: int = 0, end: int = 0) -> list:
|
||||
"""
|
||||
>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12]
|
||||
|
||||
>>> insertion_sort(array, 0, len(array))
|
||||
[1, 2, 4, 6, 7, 8, 8, 12, 14, 14, 22, 23, 27, 45, 56, 79]
|
||||
"""
|
||||
|
|
@ -27,8 +26,7 @@ def insertion_sort(array: list, start: int = 0, end: int = 0) -> list:
|
|||
def heapify(array: list, index: int, heap_size: int) -> None: # Max Heap
|
||||
"""
|
||||
>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12]
|
||||
|
||||
>>> heapify(array, len(array) // 2 ,len(array))
|
||||
>>> heapify(array, len(array) // 2, len(array))
|
||||
"""
|
||||
largest = index
|
||||
left_index = 2 * index + 1 # Left Node
|
||||
|
|
@ -47,9 +45,7 @@ def heapify(array: list, index: int, heap_size: int) -> None: # Max Heap
|
|||
|
||||
def heap_sort(array: list) -> list:
|
||||
"""
|
||||
>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12]
|
||||
|
||||
>>> heap_sort(array)
|
||||
>>> heap_sort([4, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12])
|
||||
[1, 2, 4, 6, 7, 8, 8, 12, 14, 14, 22, 23, 27, 45, 56, 79]
|
||||
"""
|
||||
n = len(array)
|
||||
|
|
@ -69,9 +65,14 @@ def median_of_3(
|
|||
) -> int:
|
||||
"""
|
||||
>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12]
|
||||
|
||||
>>> median_of_3(array, 0, 0 + ((len(array) - 0) // 2) + 1, len(array) - 1)
|
||||
>>> median_of_3(array, 0, ((len(array) - 0) // 2) + 1, len(array) - 1)
|
||||
12
|
||||
>>> array = [13, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12]
|
||||
>>> median_of_3(array, 0, ((len(array) - 0) // 2) + 1, len(array) - 1)
|
||||
13
|
||||
>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 15, 14, 27, 79, 23, 45, 14, 16]
|
||||
>>> median_of_3(array, 0, ((len(array) - 0) // 2) + 1, len(array) - 1)
|
||||
14
|
||||
"""
|
||||
if (array[first_index] > array[middle_index]) != (
|
||||
array[first_index] > array[last_index]
|
||||
|
|
@ -88,7 +89,6 @@ def median_of_3(
|
|||
def partition(array: list, low: int, high: int, pivot: int) -> int:
|
||||
"""
|
||||
>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12]
|
||||
|
||||
>>> partition(array, 0, len(array), 12)
|
||||
8
|
||||
"""
|
||||
|
|
@ -115,22 +115,16 @@ def sort(array: list) -> list:
|
|||
Examples:
|
||||
>>> sort([4, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12])
|
||||
[1, 2, 4, 6, 7, 8, 8, 12, 14, 14, 22, 23, 27, 45, 56, 79]
|
||||
|
||||
>>> sort([-1, -5, -3, -13, -44])
|
||||
[-44, -13, -5, -3, -1]
|
||||
|
||||
>>> sort([])
|
||||
[]
|
||||
|
||||
>>> sort([5])
|
||||
[5]
|
||||
|
||||
>>> sort([-3, 0, -7, 6, 23, -34])
|
||||
[-34, -7, -3, 0, 6, 23]
|
||||
|
||||
>>> sort([1.7, 1.0, 3.3, 2.1, 0.3 ])
|
||||
[0.3, 1.0, 1.7, 2.1, 3.3]
|
||||
|
||||
>>> sort(['d', 'a', 'b', 'e', 'c'])
|
||||
['a', 'b', 'c', 'd', 'e']
|
||||
"""
|
||||
|
|
@ -146,9 +140,7 @@ def intro_sort(
|
|||
) -> list:
|
||||
"""
|
||||
>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12]
|
||||
|
||||
>>> max_depth = 2 * math.ceil(math.log2(len(array)))
|
||||
|
||||
>>> intro_sort(array, 0, len(array), 16, max_depth)
|
||||
[1, 2, 4, 6, 7, 8, 8, 12, 14, 14, 22, 23, 27, 45, 56, 79]
|
||||
"""
|
||||
|
|
@ -167,7 +159,6 @@ if __name__ == "__main__":
|
|||
import doctest
|
||||
|
||||
doctest.testmod()
|
||||
|
||||
user_input = input("Enter numbers separated by a comma : ").strip()
|
||||
unsorted = [float(item) for item in user_input.split(",")]
|
||||
print(sort(unsorted))
|
||||
print(f"{sort(unsorted) = }")
|
||||
|
|
|
|||
Loading…
Reference in New Issue
Block a user