6 results about "Insertion sort" patented technology

The invention provides an insertion sorting method, device and system, a computer program product and a computer readable storage medium. The invention discloses an insertion sorting method for performing insertion sorting on a role authority management front-end page. The insertion sorting method comprises the following steps of: endowing sorting numbers to role posts displayed on the role authority management front-end page; converting each sorting number into an integer array split according to digits; determining a size relationship of each array based on comparison of array elements of the converted integer array one by one, thereby determining a sorting sequence of each sorting number, and obtaining a sorting number sequence sorted according to a comparison result; when a new sorting number M is inserted between the Nth sorting number and the (N + 1) th sorting number, the size of the array converted from the newly inserted sorting number M is between the size of the array of the Nth sorting number and the size of the array of the (N + 1) th sorting number; and inserting the sorting number M between the Nth sorting number and the (N + 1) th sorting number as the sorting number of the newly inserted role post without changing the sorting of other sorting numbers.

This invention provides a vulnerability patch sorting method based on decomposition analysis and progressive comparison. The method includes the following steps: For each candidate submission, a structured decomposition analysis report containing vulnerability-related and irrelevant changes is generated using a large language model; using this report and historical remediation cases, each candidate submission is binary-classified, with submissions classified as "yes" forming a set Y and submissions classified as "no" forming a set N, and set Y is concatenated before set N to form an initial sorting list L; for the submissions in the initial sorting list L, an insertion sort strategy is used, and pairwise comparisons are performed using the large language model to determine the final position of each submission in the ordered result list R, outputting the final sorting list. The technical solution of this invention filters out code noise, solves the problem of inability to sort multiple candidate submissions internally, and significantly improves the accuracy of vulnerability patch location and the robustness of sorting.

The application discloses a torque sensor signal filtering method, device, equipment, medium and product. The method comprises the following steps: acquiring a signal data set of a torque sensor; acquiring a window size, and generating an initial queue based on the window size and the signal data set; if there is new data, inserting the new data into the initial queue to obtain a target queue; and performing filtering processing on the signal of the torque sensor based on the target queue. Through the technical scheme of the application, the advantages of the moving average filtering method and the median filtering method are combined, the calculation efficiency is optimized by using the insertion sorting mechanism, the real-time performance and the accuracy of torque signal processing are improved, and the calculation complexity is reduced.

The application provides a computer interlocking code bit search method based on a sorting dictionary tree, comprising the following steps: S1, initializing a sorting dictionary tree data structure; S2, sequentially inserting all code bit objects contained in a code bit table, reconstructing the sorting dictionary tree data structure according to a code bit object name string each time of insertion, inserting each code bit object pointer into a sorting one-dimensional array sortedBitArr in sequence, and refilling a two-dimensional array val2NodesArr used for determining a starting search dictionary tree node according to a newly added tree node; S3, obtaining all starting search dictionary tree nodes based on the two-dimensional array val2NodesArr according to a keyword input by a user at present, sequentially preorder traversing the sorting dictionary tree from each starting search dictionary tree node, and if the keyword matches successfully, combining the sorting one-dimensional array sortedBitArr to determine all code bit objects meeting the requirement and putting the code bit objects into a search result set. The application greatly improves the search efficiency, success rate and availability of the search method, reduces the address space consumption of each dictionary tree node, and shortens the search consumption time.

The invention discloses a microcontroller-oriented efficient sliding window median filtering method, system and application, the method comprises an initialization stage, a sliding updating stage and an output stage, and the system comprises a memory, a microcontroller and an ADC module. The method has extremely high calculation efficiency, and the ordered array is maintained through increment, so that full-quantity sorting during window sliding each time is avoided. Experiments show that on a typical MCU, when the window size is 9, the time consumption of single filtering can be reduced by more than 60% compared with the traditional full-insertion sorting, and the microsecond level is reached. The method has the advantages that the method is simple, the method keeps excellent pulse noise resistance of median filtering, outliers can be effectively eliminated, response to real sudden change of signals is quick, excessive smoothness is avoided, and excellent filtering effects are guaranteed.

The invention relates to a file list sorting method and device, and the method comprises the steps: responding to a file sorting instruction triggered by a user at a terminal, and entering a file sorting mode; under the file sorting mode, items in the file list are presented on an interface in a grid sequence mode, and a virtual abacus control is displayed on one side of the interface; receiving a selection operation of a user on at least one file grid, and highlighting the selected file grid and the corresponding abacus beads; receiving an operation of a user on the virtual abacus control or the associated control area, and determining a target position of file insertion or classification according to the operation; and performing insertion sorting on the selected files at the target position, or classifying the selected files to a folder corresponding to the target position. In this way, automatic rolling of the list is achieved through pressure sensing control, accurate insertion sorting or rapid folder classification of the selected files is achieved by means of the unique mode that insertion spaces are reserved by shifting the abacus beads, and the processing efficiency of operation can be improved to a great extent.