Merge branch 'master' into fix-14970-bucket-sort-float

Author: cclauss

.pre-commit-config.yaml

@@ -34,13 +34,13 @@ repos:
       - id: pyproject-fmt
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.16.6
+    rev: v0.16.7
     hooks:
       - id: ruff-check
       - id: ruff-format
 
   - repo: https://github.com/rvben/rumdl-pre-commit
-    rev: v0.2.69
+    rev: v0.2.73
     hooks:
       - id: rumdl-fmt
       - id: rumdl
@@ -55,7 +55,7 @@ repos:
         pass_filenames: false
 
   - repo: https://github.com/astral-sh/uv-pre-commit
-    rev: 0.12.11
+    rev: 0.12.13
     hooks:
       - id: uv-lock
 

DIRECTORY.md

@@ -181,12 +181,14 @@
 ## [Computer Vision](computer_vision)
   * [Cnn Classification](computer_vision/cnn_classification.py)
   * [Flip Augmentation](computer_vision/flip_augmentation.py)
+  * [Gramian](computer_vision/gramian.py)
   * [Haralick Descriptors](computer_vision/haralick_descriptors.py)
   * [Harris Corner](computer_vision/harris_corner.py)
   * [Horn Schunck](computer_vision/horn_schunck.py)
   * [Intensity Based Segmentation](computer_vision/intensity_based_segmentation.py)
   * [Mean Threshold](computer_vision/mean_threshold.py)
   * [Mosaic Augmentation](computer_vision/mosaic_augmentation.py)
+  * [Otsu Threshold](computer_vision/otsu_threshold.py)
   * [Pooling Functions](computer_vision/pooling_functions.py)
   * [Vision Transformer](computer_vision/vision_transformer.py)
 
@@ -230,6 +232,7 @@
   * [Lempel Ziv](data_compression/lempel_ziv.py)
   * [Lempel Ziv Decompress](data_compression/lempel_ziv_decompress.py)
   * [Lz77](data_compression/lz77.py)
+  * [Move To Front](data_compression/move_to_front.py)
   * [Peak Signal To Noise Ratio](data_compression/peak_signal_to_noise_ratio.py)
   * [Run Length Encoding](data_compression/run_length_encoding.py)
 
@@ -323,16 +326,19 @@
     * [From Sequence](data_structures/linked_list/from_sequence.py)
     * [Has Loop](data_structures/linked_list/has_loop.py)
     * [Is Palindrome](data_structures/linked_list/is_palindrome.py)
+    * [Kth Element From End](data_structures/linked_list/kth_element_from_end.py)
     * [Merge Sort Linked List](data_structures/linked_list/merge_sort_linked_list.py)
     * [Merge Two Lists](data_structures/linked_list/merge_two_lists.py)
     * [Middle Element Of Linked List](data_structures/linked_list/middle_element_of_linked_list.py)
+    * [Partition Linked List](data_structures/linked_list/partition_linked_list.py)
     * [Print Reverse](data_structures/linked_list/print_reverse.py)
     * [Reverse K Group](data_structures/linked_list/reverse_k_group.py)
     * [Rotate To The Right](data_structures/linked_list/rotate_to_the_right.py)
     * [Singly Linked List](data_structures/linked_list/singly_linked_list.py)
     * [Skip List](data_structures/linked_list/skip_list.py)
     * [Sorted Linked List](data_structures/linked_list/sorted_linked_list.py)
     * [Swap Nodes](data_structures/linked_list/swap_nodes.py)
+    * [Xor Linked List](data_structures/linked_list/xor_linked_list.py)
   * Queues
     * [Circular Queue](data_structures/queues/circular_queue.py)
     * [Circular Queue Linked List](data_structures/queues/circular_queue_linked_list.py)
@@ -424,6 +430,7 @@
   * [Climbing Stairs](dynamic_programming/climbing_stairs.py)
   * [Combination Sum Iv](dynamic_programming/combination_sum_iv.py)
   * [Edit Distance](dynamic_programming/edit_distance.py)
+  * [Egg Dropping](dynamic_programming/egg_dropping.py)
   * [Factorial](dynamic_programming/factorial.py)
   * [Fast Fibonacci](dynamic_programming/fast_fibonacci.py)
   * [Fibonacci](dynamic_programming/fibonacci.py)
@@ -454,6 +461,7 @@
   * [Minimum Steps To One](dynamic_programming/minimum_steps_to_one.py)
   * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
   * [Narcissistic Number](dynamic_programming/narcissistic_number.py)
+  * [Needleman Wunsch](dynamic_programming/needleman_wunsch.py)
   * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
   * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
   * [Range Sum Query](dynamic_programming/range_sum_query.py)
@@ -540,6 +548,7 @@
   * Tests
     * [Test Graham Scan](geometry/tests/test_graham_scan.py)
     * [Test Jarvis March](geometry/tests/test_jarvis_march.py)
+  * [Triangle](geometry/triangle.py)
 
 ## [Graphics](graphics)
   * [Bezier Curve](graphics/bezier_curve.py)
@@ -589,6 +598,7 @@
   * [Graphs Floyd Warshall](graphs/graphs_floyd_warshall.py)
   * [Greedy Best First](graphs/greedy_best_first.py)
   * [Greedy Min Vertex Cover](graphs/greedy_min_vertex_cover.py)
+  * [Hopcroft Karp](graphs/hopcroft_karp.py)
   * [Johnson](graphs/johnson.py)
   * [Kahns Algorithm Long](graphs/kahns_algorithm_long.py)
   * [Kahns Algorithm Topo](graphs/kahns_algorithm_topo.py)
@@ -613,6 +623,7 @@
     * [Test Johnson](graphs/tests/test_johnson.py)
     * [Test Min Spanning Tree Kruskal](graphs/tests/test_min_spanning_tree_kruskal.py)
     * [Test Min Spanning Tree Prim](graphs/tests/test_min_spanning_tree_prim.py)
+  * [Travelling Salesman Problem](graphs/travelling_salesman_problem.py)
 
 ## [Greedy Methods](greedy_methods)
   * [Best Time To Buy And Sell Stock](greedy_methods/best_time_to_buy_and_sell_stock.py)
@@ -648,6 +659,7 @@
     * [Test Knapsack](knapsack/tests/test_knapsack.py)
 
 ## [Linear Algebra](linear_algebra)
+  * [Gauss Jordan](linear_algebra/gauss_jordan.py)
   * [Gaussian Elimination](linear_algebra/gaussian_elimination.py)
   * [Jacobi Iteration Method](linear_algebra/jacobi_iteration_method.py)
   * [Lu Decomposition](linear_algebra/lu_decomposition.py)
@@ -1372,6 +1384,7 @@
 ## [Sorts](sorts)
   * [Adaptive Merge Sort](sorts/adaptive_merge_sort.py)
   * [Bead Sort](sorts/bead_sort.py)
+  * [Benchmark Sorts](sorts/benchmark_sorts.py)
   * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
   * [Bitonic Sort](sorts/bitonic_sort.py)
   * [Bogo Sort](sorts/bogo_sort.py)

bit_manipulation/binary_count_setbits.py

@@ -30,7 +30,7 @@ def binary_count_setbits(a: int) -> int:
     """
     if a < 0:
         raise ValueError("Input value must be a positive integer")
-    elif isinstance(a, float):
+    if isinstance(a, float):
         raise TypeError("Input value must be a 'int' type")
     return bin(a).count("1")
 

bit_manipulation/binary_count_trailing_zeros.py

@@ -33,7 +33,7 @@ def binary_count_trailing_zeros(a: int) -> int:
     """
     if a < 0:
         raise ValueError("Input value must be a positive integer")
-    elif isinstance(a, float):
+    if isinstance(a, float):
         raise TypeError("Input value must be a 'int' type")
     return 0 if (a == 0) else int(log2(a & -a))
 

bit_manipulation/single_bit_manipulation_operations.py

@@ -94,6 +94,29 @@ def get_bit(number: int, position: int) -> int:
     return int((number & (1 << position)) != 0)
 
 
+def clear_least_significant_set_bit(number: int) -> int:
+    """
+    Clear the least significant set bit (rightmost 1 bit).
+
+    Subtracting 1 changes the rightmost 1 to 0 and the 0 bits to its right to 1.
+    ANDing the result with the original number therefore clears that set bit.
+    For negative integers, Python's infinite sign extension is used.
+    https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan
+
+    >>> clear_least_significant_set_bit(0b101100)  # 0b101000
+    40
+    >>> clear_least_significant_set_bit(0b1000)  # 0b0
+    0
+    >>> clear_least_significant_set_bit(0)
+    0
+    >>> clear_least_significant_set_bit(0b1111)  # 0b1110
+    14
+    >>> clear_least_significant_set_bit(-5)
+    -6
+    """
+    return number & (number - 1)
+
+
 if __name__ == "__main__":
     import doctest
 

ciphers/enigma_machine2.py

@@ -134,10 +134,10 @@ def _plugboard(pbstring: str) -> dict[str, str]:
     if not isinstance(pbstring, str):
         msg = f"Plugboard setting isn't type string ({type(pbstring)})"
         raise TypeError(msg)
-    elif len(pbstring) % 2 != 0:
+    if len(pbstring) % 2 != 0:
         msg = f"Odd number of symbols ({len(pbstring)})"
         raise Exception(msg)
-    elif pbstring == "":
+    if pbstring == "":
         return {}
 
     pbstring.replace(" ", "")
@@ -148,11 +148,10 @@ def _plugboard(pbstring: str) -> dict[str, str]:
         if i not in abc:
             msg = f"'{i}' not in list of symbols"
             raise Exception(msg)
-        elif i in tmppbl:
+        if i in tmppbl:
             msg = f"Duplicate symbol ({i})"
             raise Exception(msg)
-        else:
-            tmppbl.add(i)
+        tmppbl.add(i)
     del tmppbl
 
     # Created the dictionary

ciphers/simple_substitution_cipher.py

@@ -22,6 +22,16 @@ def main() -> None:
 
 
 def check_valid_key(key: str) -> None:
+    """
+    Check if the key is valid (contains all 26 letters of the alphabet exactly once).
+    Exits the program if the key is invalid.
+
+    >>> check_valid_key('LFWOAYUISVKMNXPBDCRJTQEGHZ')
+    >>> check_valid_key('INVALIDKEY')
+    Traceback (most recent call last):
+        ...
+    SystemExit: Error in the key or symbol set.
+    """
     key_list = list(key)
     letters_list = list(LETTERS)
     key_list.sort()
@@ -69,6 +79,13 @@ def translate_message(key: str, message: str, mode: str) -> str:
 
 
 def get_random_key() -> str:
+    """
+    Generate a random substitution cipher key.
+
+    >>> random.seed(0)
+    >>> get_random_key()
+    'OAXSGFHKWUECVDRLTJZPQIBNYM'
+    """
     key = list(LETTERS)
     random.shuffle(key)
     return "".join(key)

ciphers/xor_cipher.py

@@ -21,7 +21,7 @@
 
 
 class XORCipher:
-    def __init__(self, key: int = 0):
+    def __init__(self, key: int = 0) -> None:
         """
         simple constructor that receives a key or uses
         default key = 0

computer_vision/README.md

@@ -1,10 +1,11 @@
 # Computer Vision
 
-Computer vision is a field of computer science that works on enabling computers to see, identify and process images in the same way that human does, and provide appropriate output.
+Computer vision is an interdisciplinary field focused on enabling computers to gain high-level understanding from images and video—automatically extracting, analyzing, and interpreting visual information to produce outputs such as labels, measurements, 3D structure, or decisions.
 
-It is like imparting human intelligence and instincts to a computer.
-Image processing and computer vision are a little different from each other. Image processing means applying some algorithms for transforming image from one form to the other like smoothing, contrasting, stretching, etc.
+In practice, computer vision methods combine geometry, physics, statistics, and machine learning to connect pixel data to semantic concepts like objects, actions, and scenes.
 
-While computer vision comes from modelling image processing using the techniques of machine learning, computer vision applies machine learning to recognize patterns for interpretation of images (much like the process of visual reasoning of human vision).
+## Image processing vs. computer vision
 
-* <https://en.wikipedia.org/wiki/Computer_vision>
+Image processing primarily transforms images (e.g., denoising, contrast enhancement, geometric warping) where the output is another image.
+
+Computer vision uses images/video as input but often outputs information about the scene (e.g., detections, segmentation masks, pose estimates, tracking results, or a decision), which may then drive downstream behavior in a larger system.

computer_vision/cnn_classification.py

@@ -94,7 +94,6 @@
     test_image = np.expand_dims(test_image, axis=0)
     result = classifier.predict(test_image)
     # training_set.class_indices
-    if result[0][0] == 0:
-        prediction = "Normal"
-    if result[0][0] == 1:
-        prediction = "Abnormality detected"
+    # The sigmoid output is a probability in the range [0, 1].
+    # Use a threshold of 0.5 to convert the probability into a binary prediction.
+    prediction = "Normal" if result[0][0] < 0.5 else "Abnormality detected"