Quick-sorting in page method based on quick sorting computation

A technology of quick sorting and sorting methods, applied in computing, instruments, electrical digital data processing, etc., can solve problems such as large computing overhead, achieve the effects of reducing time complexity, reducing computing overhead, and avoiding repeated calculations

Active Publication Date: 2005-02-16
PEKING UNIV +1
View PDF0 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

From an application point of view, at this time, only the output results are required to be the 101st to 120th items sorted according to the requirements, and there is no requirement on whether other data items are in order, but from the existing methods, when all data are completely Before sorting, it is difficult to know what data is included in the specified range and the order between them, so the existing technology is to completely sort all the data first, and then output the data subset of the specified range, which inevitably involves a lot of unnecessary computing overhead

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Quick-sorting in page method based on quick sorting computation
  • Quick-sorting in page method based on quick sorting computation
  • Quick-sorting in page method based on quick sorting computation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] Because the pagination sorting concept is proposed for the first time in this field, in order to clarify the problem solved by the present invention, the formalized definition of the paging sorting problem is as follows:

[0033] Define "page-ordered": for the collection {A j}, if the key K of the elements in the collection i , satisfy the following formula, then the set {A j} Ordered pagination in the interval [first, last].

[0034]

[0035] Where: 1≤first≤last≤N

[0036] Define "page sort": For a collection {A j}, the so-called pair {A j}Pagination sorting in the interval [first, last] is to reorganize the elements in the collection, so that the new ordered collection is ordered in the interval [first, last].

[0037] The specific embodiment of the present invention will be further described below in conjunction with the accompanying drawings.

[0038] Such as figure 1 As shown, a kind of quick paging sorting method based on quick sort algorithm of the presen...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention relates to a quick paging sorting method based on quick serting algorithm. It is characterized by that it adopts a divide-and-conquer strategy similar to quick sorting algorithm, utilizes buffer storage mechansm to continuously remove the elements which are not belonged to the defined range, and progressively sort and position the data which are belonged to the defined range so as to can resolve the problem of quick paging sorting process.

Description

technical field [0001] The invention belongs to the technical field of intelligent information processing, and in particular relates to a quick paging sorting method based on a quick sorting algorithm. Background technique [0002] Sorting is the basic function of computer information processing, and it has a wide range of applications, especially in information retrieval, database systems, data analysis and data mining. [0003] At present, the main method of internal sorting by computer is based on the comparison and exchange of keywords. Among the various sorting methods based on this idea, the Quick Sort algorithm (Quick Sort) has the best average characteristics, and its time The complexity is 0(N log 2 N), and is close to the theoretical lower bound. (Donald E. Knuth. The art of computer programming (J) Sorting and Searching, Addison Wesley Publishing Company, Inc., Vo3, 1973: 145-158) [0004] The basic idea of ​​the quick sort algorithm is based on a divide-and-co...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor 杨建武陈晓鸥吴於茜
Owner PEKING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap