diff --git a/graphs/kahns_algorithm_topo.py b/graphs/kahns_algorithm_topo.py
index c956cf9f48fd..df5d1d72b9b8 100644
--- a/graphs/kahns_algorithm_topo.py
+++ b/graphs/kahns_algorithm_topo.py
@@ -1,3 +1,6 @@
+from collections import deque
+
+
 def topological_sort(graph: dict[int, list[int]]) -> list[int] | None:
     """
     Perform topological sorting of a Directed Acyclic Graph (DAG)
@@ -21,10 +24,17 @@ def topological_sort(graph: dict[int, list[int]]) -> list[int] | None:
 
     >>> graph_with_cycle = {0: [1], 1: [2], 2: [0]}
     >>> topological_sort(graph_with_cycle)
+
+    >>> sparse_graph = {10: [20], 20: []}
+    >>> topological_sort(sparse_graph)
+    [10, 20]
+
+    >>> sparse_cycle = {10: [20], 20: [10]}
+    >>> topological_sort(sparse_cycle)
     """
 
-    indegree = [0] * len(graph)
-    queue = []
+    indegree = dict.fromkeys(graph, 0)
+    queue: deque[int] = deque()
     topo_order = []
     processed_vertices_count = 0
 
@@ -34,13 +44,13 @@ def topological_sort(graph: dict[int, list[int]]) -> list[int] | None:
             indegree[i] += 1
 
     # Add all vertices with 0 indegree to the queue
-    for i in range(len(indegree)):
-        if indegree[i] == 0:
-            queue.append(i)
+    for vertex, count in indegree.items():
+        if count == 0:
+            queue.append(vertex)
 
     # Perform BFS
     while queue:
-        vertex = queue.pop(0)
+        vertex = queue.popleft()
         processed_vertices_count += 1
         topo_order.append(vertex)
 
diff --git a/searches/ternary_search.py b/searches/ternary_search.py
index 73e4b1ddc68b..b51c839e1dbf 100644
--- a/searches/ternary_search.py
+++ b/searches/ternary_search.py
@@ -82,6 +82,11 @@ def ite_ternary_search(array: list[int], target: int) -> int:
     -1
     >>> ite_ternary_search([.1, .4 , -.1], .1)
     0
+    >>> test_list_large = list(range(100))
+    >>> ite_ternary_search(test_list_large, 65)
+    65
+    >>> ite_ternary_search(test_list_large, 105)
+    -1
     """
 
     left = 0
@@ -90,8 +95,8 @@ def ite_ternary_search(array: list[int], target: int) -> int:
         if right - left < precision:
             return lin_search(left, right, array, target)
 
-        one_third = (left + right) // 3 + 1
-        two_third = 2 * (left + right) // 3 + 1
+        one_third = left + (right - left) // 3
+        two_third = right - (right - left) // 3
 
         if array[one_third] == target:
             return one_third
@@ -99,13 +104,13 @@ def ite_ternary_search(array: list[int], target: int) -> int:
             return two_third
 
         elif target < array[one_third]:
-            right = one_third - 1
+            right = one_third
         elif array[two_third] < target:
             left = two_third + 1
 
         else:
             left = one_third + 1
-            right = two_third - 1
+            right = two_third
     return -1
 
 
@@ -133,12 +138,19 @@ def rec_ternary_search(left: int, right: int, array: list[int], target: int) ->
     -1
     >>> rec_ternary_search(0, 3, [.1, .4 , -.1], .1)
     0
+    >>> test_list_large = list(range(100))
+    >>> rec_ternary_search(0, len(test_list_large), test_list_large, 65)
+    65
+    >>> rec_ternary_search(20, 80, test_list_large, 65)
+    65
+    >>> rec_ternary_search(20, 80, test_list_large, 15)
+    -1
     """
     if left < right:
         if right - left < precision:
             return lin_search(left, right, array, target)
-        one_third = (left + right) // 3 + 1
-        two_third = 2 * (left + right) // 3 + 1
+        one_third = left + (right - left) // 3
+        two_third = right - (right - left) // 3
 
         if array[one_third] == target:
             return one_third
@@ -146,11 +158,11 @@ def rec_ternary_search(left: int, right: int, array: list[int], target: int) ->
             return two_third
 
         elif target < array[one_third]:
-            return rec_ternary_search(left, one_third - 1, array, target)
+            return rec_ternary_search(left, one_third, array, target)
         elif array[two_third] < target:
             return rec_ternary_search(two_third + 1, right, array, target)
         else:
-            return rec_ternary_search(one_third + 1, two_third - 1, array, target)
+            return rec_ternary_search(one_third + 1, two_third, array, target)
     else:
         return -1
 
@@ -165,7 +177,7 @@ def rec_ternary_search(left: int, right: int, array: list[int], target: int) ->
     assert collection == sorted(collection), f"List must be ordered.\n{collection}."
     target = int(input("Enter the number to be found in the list:\n").strip())
     result1 = ite_ternary_search(collection, target)
-    result2 = rec_ternary_search(0, len(collection) - 1, collection, target)
+    result2 = rec_ternary_search(0, len(collection), collection, target)
     if result2 != -1:
         print(f"Iterative search: {target} found at positions: {result1}")
         print(f"Recursive search: {target} found at positions: {result2}")