JIYIK CN >

In the article "Quick Sort", we introduced the principles and steps of quick sort, and implemented the algorithm using recursion. In the previous article, we also mentioned the use of non-recursive methods to implement the algorithm. In thi...

Quick sort is a sorting algorithm developed by Tony Hall. On average, sorting n items requires O(n log n) comparisons. In the worst case, O(n2) comparisons are required, but this is uncommon. In fact, quick sort is often significantly faste...

In the article "Merge Sort", we introduced the principles and operation steps of merge sort, and finally implemented the sorting algorithm using PHP code. In the program, we used the principle of recursion to implement the algorithm. In fac...

Let's first look at the definition of merge sort Merge sort is an effective sorting algorithm based on the merge operation. This algorithm is a very typical application of the Divide and Conquer method. Merge the ordered subsequences to obt...

The singleton design pattern is one of the most commonly used design patterns. The singleton design pattern, just by its name, you can roughly know its meaning. Single means one; instance means instance object. So a singleton has only one i...

Hill sort is named after the designer of the algorithm, Hill. It is an improvement of Hill on the basis of insertion sort and can be said to be a special insertion sort. Here are the properties of insertion sort: First of all, the insertion...

Table insertion sort was briefly mentioned in Insertion sort (concept) . I briefly summarized it and wrote this article. You can refer to it if you need it. Table insertion sort, as the name implies, uses an index table to sort the original...

This article follows the insertion sort (concept article) and presents the implementation steps and implementation code of the binary insertion sort Binary Insertion Sort Algorithm Steps Treat the first element of the first sequence to be s...

This article follows up on Insertion Sort (Concepts) and presents the implementation steps and code for direct insertion sort. Since the Concepts section already has a large number of illustrations, it would be a bit long-winded to provide...

What is "insertion sort"? The concept is as follows: each time a record to be sorted is inserted into the previously sorted sequence according to its key size, until all records are inserted. Concepts are always somewhat abstract, and can a...

Binary search is the most popular and efficient search algorithm. In fact, it is the fastest search algorithm. Like jump sort, it also requires the array to be sorted. It is based on a divide and conquer approach where we divide the array i...

Fibonacci search is an efficient interval search algorithm. It is similar to binary search in that it is also based on a divide-and-conquer strategy and also requires the array to be sorted. In addition, the time complexity of both algorith...

Skip search is a range search algorithm. It is a relatively new algorithm that works only on sorted arrays. It tries to reduce the number of comparisons required compared to linear search by not scanning every element like linear search. In...

Exponential search, also known as doubling search or finger search, is an algorithm created for searching elements in large arrays. It is a two-step process. First, the algorithm tries to find the range in which the target element exists (L，...

Linear search is the simplest search algorithm. It is also called sequential search because in this algorithm, we look for the matching element by going through the entire array and comparing each element with the required item. If the requ...