algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 01:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Pyupgrade to Python 3.9 (#4718)

Browse Source 
* Pyupgrade to Python 3.9

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2021-09-07 13:37:03 +02:00
committed by GitHub
parent 5d5831bdd0
commit cecf43d648
142 changed files with 523 additions and 530 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
searches/ternary_search.py
View File

@ -6,7 +6,7 @@ This is a type of divide and conquer algorithm which divides the search space in
Time Complexity : O(log3 N)
Space Complexity : O(1)
"""
from typing import List
from __future__ import annotations
# This is the precision for this function which can be altered.
# It is recommended for users to keep this number greater than or equal to 10.
@ -16,7 +16,7 @@ precision = 10
# This is the linear search that will occur after the search space has become smaller.
def lin_search(left: int, right: int, array: List[int], target: int) -> int:
def lin_search(left: int, right: int, array: list[int], target: int) -> int:
"""Perform linear search in list. Returns -1 if element is not found.
Parameters
@ -58,7 +58,7 @@ def lin_search(left: int, right: int, array: List[int], target: int) -> int:
return -1
def ite_ternary_search(array: List[int], target: int) -> int:
def ite_ternary_search(array: list[int], target: int) -> int:
"""Iterative method of the ternary search algorithm.
>>> test_list = [0, 1, 2, 8, 13, 17, 19, 32, 42]
>>> ite_ternary_search(test_list, 3)
@ -110,7 +110,7 @@ def ite_ternary_search(array: List[int], target: int) -> int:
return -1
def rec_ternary_search(left: int, right: int, array: List[int], target: int) -> int:
def rec_ternary_search(left: int, right: int, array: list[int], target: int) -> int:
"""Recursive method of the ternary search algorithm.
>>> test_list = [0, 1, 2, 8, 13, 17, 19, 32, 42]