37 results about "Comparison sort" patented technology

Embodiments of the present invention provide a method, computer program product and system for increasing sorting efficiency by utilizing a determined crossover point. Initially, a set of data, containing a number of tuples, to be sorted is received. A determination is made as to the number of radix sort iterations to perform based on the number of tuples of the received data. A countdown timer is set based on the determined number of radix sort iterations. Radix sorts iterations are performed recursively. After each iteration, the countdown timer is decreased. Upon the countdown timer reaching zero, one or more comparison sorts is performed on the remainder of the set of data not sorted by the radix sorting.

The invention discloses a pulse pairing method based on substring search, which can more quickly handle the situations of larger received pulses and less target radiation source pulses, and reduce false peak influences formed by a cross term, and belongs to the technical field of signal processing. The method comprises the following steps: firstly, performing pulse pre-sorting on a pulse sequence received by a master station, so as to obtain a pulse time interval sequence PRI1 of the master station, and quantifying; determining a time range of a corresponding secondary station, and obtaining a pulse time interval sequence PRI2 of the secondary station; constructing n suffixes of the sequence PRI1 and the sequence PRI2 for dictionary comparison sorting; screening two adjacent suffixes respectively belonging to the mater station and the secondary station and taking the maximum common prefix of the two adjacent suffixes; obtaining corresponding pulse trains, respectively used as a master station substring and a secondary station substring, of the maximum common prefix in the master station and the secondary station; performing joint operation on the master station substring and the secondary station substring, and then re-ordering according to an average time difference value, so as to obtain a pulse pairing result.

An adjacent sample comparison processor (201) compares power values of adjacent samples of a delay profile created according to a reception signal over-sampled and detects whether the power value is increasing or decreasing. If the comparison result is identical to the increase / decrease information on the power values between adjacent samples at the previous time, a comparison result storage processor (204) adds 1. If the comparison result is different, the comparison result storage processor (204) performs a reset and newly sets 1. When the count of the comparison result storage processor (204) has become identical to the over-sampling number, a slope judgment processor (205) controls a path selection section (207) so as to select a corresponding sample as a path. The path selection section (207) selects a relative maximum sample as a path candidate and also selects the sample instructed by the slope judgment processor (205) as a path. Thus, it is possible to reduce the calculation amount when selecting a path, assure a path selection, and reduce the reception data error ratio.

Embodiments of the present invention provide a method, computer program product and system for increasing sorting efficiency by utilizing a determined crossover point. Initially, a set of data, containing a number of tuples, to be sorted is received. A determination is made as to the number of radix sort iterations to perform based on the number of tuples of the received data. A countdown timer is set based on the determined number of radix sort iterations. Radix sorts iterations are performed recursively. After each iteration, the countdown timer is decreased. Upon the countdown timer reaching zero, one or more comparison sorts is performed on the remainder of the set of data not sorted by the radix sorting.