Blog

This article introduces basic operations of Python OpenCV, including installation, image reading, and displaying. OpenCV is an open-source computer vision library. It can be installed via `pip install

Radix sort is a non-comparison integer sorting algorithm that uses the least significant digit first (LSD) approach, sorting numbers digit by digit (units, tens, etc.) without comparing element sizes.

Bucket sort is a non-comparison sorting algorithm that sorts elements by distributing them into multiple "buckets", sorting each bucket individually, and then merging the sorted buckets. The core is t

**Counting Sort** is a non-comparison sorting algorithm. Its core idea is to construct a sorted array by counting the occurrences of elements, making it suitable for scenarios where the range of integ

Merge sort is based on the divide-and-conquer principle, with the core being "divide-merge": first recursively split the array into individual elements (where subarrays are ordered), then merge two or

Heap sort is an efficient sorting algorithm based on the heap data structure, with a time complexity of O(n log n) and a space complexity of O(1), making it suitable for large-scale data. A heap is a

Selection sort is a simple and intuitive sorting algorithm. Its core idea is to repeatedly select the smallest (or largest) element from the unsorted elements and place it at the end of the sorted seq

Shell Sort is an improved version of Insertion Sort, also known as "diminishing increment sort". It efficiently sorts arrays by performing insertion sorts on grouped subsequences and gradually reducin

Insertion sort is a simple and intuitive sorting algorithm whose core idea is to insert elements one by one into their appropriate positions in a sorted subarray (similar to sorting playing cards). Th

QuickSort is based on the divide-and-conquer method with an average time complexity of O(n log n), widely used in practical applications. Its core idea involves selecting a pivot element, partitioning