JPH03260722A - Sorting system - Google Patents

Sorting system

Info

Publication number
JPH03260722A
JPH03260722A JP5916990A JP5916990A JPH03260722A JP H03260722 A JPH03260722 A JP H03260722A JP 5916990 A JP5916990 A JP 5916990A JP 5916990 A JP5916990 A JP 5916990A JP H03260722 A JPH03260722 A JP H03260722A
Authority
JP
Japan
Prior art keywords
data
paired
sorting
sorted
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP5916990A
Other languages
Japanese (ja)
Inventor
Naoto Katsurajima
桂島　直人
Masahito Takemura
竹村　政仁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Priority to JP5916990A priority Critical patent/JPH03260722A/en
Publication of JPH03260722A publication Critical patent/JPH03260722A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To shorten the processing time for a sorting system by providing a data shift means which rearranges simultaneously the data to be paired with each other every time a single type of data is sorted. CONSTITUTION:When the data A is sorted, the 2nd data is compared with the n-th data. Then the position of the data A is replaced if the n-th data is larger than the 2nd one. In this case, the data B and the data X which are paired with the data A are also replaced at one time like the data A. Based on the sorted final result, both data B and X paired with the data A are also shifted like the movement of the data A. Thus it is possible to guarantee the accuracy showing that the data are paired and the processing time is shortened as long as plural paired data are treated without separating them from each other.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は複数の対となっているデータをソートするソー
ト方式に関する。DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a sorting method for sorting a plurality of pairs of data.

〔従来の技術〕[Conventional technology]

従来、この種のソート方式は、ソートを行なったデータ
のソートをする前の状態とソートをした後の状態とを比
較して、対になっていたデータを並び代えている。Conventionally, this type of sorting method compares the state of sorted data before and after sorting, and then rearranges paired data.

〔発明が解決しようとする課題〕[Problem to be solved by the invention]

上述した従来のソート方式では、複数の対になっている
データを一時的に切離して扱っているので、後で再び対
にする作業を行なう必要があり、さらに正しく対になっ
ているかの確認をとるための処理に時間を要するという
欠点がある。In the conventional sorting method described above, multiple pairs of data are temporarily separated and handled, so it is necessary to re-pair them later, and it is necessary to confirm that they are correctly paired. The disadvantage is that it takes time to process the data.

〔課題を解決するための手段〕[Means to solve the problem]

本発明のソート方式は、複数が対になっているデータの
中でソートを行いない１種類のデータをソートの対象に
してソートするソート手段と、このソート手段が前記１
種類のデータについてソートするごとに対となるデータ
も同時に並べ替えるデータ移動手段とを有することによ
り構成される。The sorting method of the present invention includes a sorting means for sorting one type of data that is not to be sorted among a plurality of pairs of data;
The present invention is constructed by having a data moving means for simultaneously rearranging paired data each time data of a type is sorted.

〔実施例〕〔Example〕

次に、本発明について図面を参照して説明する。 Next, the present invention will be explained with reference to the drawings.

第１図は本発明の処理フローを説明するための図である
。第１図（ａ）は処理されるデータの構造を示していて
、データＡをソート対象とした場合に、２番目のデータ
とｎ番目のデータとを比較して、ｎ番目のデータが大き
いときは第１図（ｂ）に示すようにデータＡの位置が入
替る。このときデータＡに対になっているデータＢ、デ
ータＸも同時にデータＡと同じに入替える。第１図（ｃ
）はソートされた最終的な結果を示しているが、この場
合もデータＡに対になっているデータＢ、データＸはデ
ータＡの動きと同じように移動される。FIG. 1 is a diagram for explaining the processing flow of the present invention. Figure 1 (a) shows the structure of the data to be processed. When data A is the sorting target, comparing the second data with the n-th data, if the n-th data is larger, then The position of data A is swapped as shown in FIG. 1(b). At this time, data B and data X, which are paired with data A, are also replaced with data A at the same time. Figure 1 (c
) shows the final sorted result, and in this case as well, data B and data X, which are paired with data A, are moved in the same way as data A is moved.

〔発明の効果〕〔Effect of the invention〕

以上説明したように本発明は、対になっている複数のデ
ータを切離さずに扱うことにより、データが対であるこ
との正確さが保証され、処理に対する時間を短縮できる
効果がある。As explained above, the present invention has the effect of handling a plurality of pairs of data without separating them, thereby guaranteeing the accuracy of the pairing of data, and shortening the processing time.

図、第１図（ｂ）は本発明による処理の中間段階におけ
るデータの構造図、第１図（ｃ）は本発明による処理の
最終段階におけるデータの構造図である。1(b) is a data structure diagram at an intermediate stage of processing according to the present invention, and FIG. 1(c) is a data structure diagram at the final stage of processing according to the present invention.

Claims (1)

【特許請求の範囲】[Claims] 複数が対になつているデータの中でソートを行いたい１
種類のデータをソートの対象にしてソートするソート手
段と、このソート手段が前記１種類のデータについてソ
ートするごとに対となるデータも同時に並べ替えるデー
タ移動手段とを有することを特徴とするソート方式。I want to sort data that has multiple pairs 1
A sorting method characterized by having a sorting means for sorting data of different types, and a data moving means for simultaneously rearranging paired data each time the sorting means sorts the one type of data. .
JP5916990A 1990-03-09 1990-03-09 Sorting system Pending JPH03260722A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP5916990A JPH03260722A (en) 1990-03-09 1990-03-09 Sorting system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP5916990A JPH03260722A (en) 1990-03-09 1990-03-09 Sorting system

Publications (1)

Publication Number Publication Date
JPH03260722A true JPH03260722A (en) 1991-11-20

Family

ID=13105613

Family Applications (1)

Application Number Title Priority Date Filing Date
JP5916990A Pending JPH03260722A (en) 1990-03-09 1990-03-09 Sorting system

Country Status (1)

Country Link
JP (1) JPH03260722A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7769973B2 (en) 2003-09-30 2010-08-03 Telefonaktiebolaget L M Ericsson (Publ) In-place data deinterleaving

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7769973B2 (en) 2003-09-30 2010-08-03 Telefonaktiebolaget L M Ericsson (Publ) In-place data deinterleaving

Similar Documents

Publication Publication Date Title
JP2780702B2 (en) Production control system and production control method
GB1284421A (en) Data processing apparatus
US20010034749A1 (en) Spatial median filter
JPH03260722A (en) Sorting system
JP2817517B2 (en) LSI placement and routing system
JPH04101233A (en) Task controlling method by two-hierarchy queue structure
JPH01173230A (en) Merge processing system
JP3680446B2 (en) Pipeline control device and data processing method
JPH02259827A (en) Record editing system
JPH0267639A (en) Queue control system with priority
JP2667474B2 (en) Block placement method
JPH0324629A (en) Method for controlling task
JPH04180124A (en) Sort processor
JPH01102636A (en) Sorting circuit
JPH0323745A (en) Digital data input system
JPH07106214A (en) Sorter for semiconductor wafer
JPS59108106A (en) Retrieving system of shortest route between many points
JPH0366115A (en) Semiconductor process support system
JPH04155521A (en) Sorting processing system
JPH0334015A (en) Input/output parallel processing method in quick sorting technique
JPH05341960A (en) Data sorting system
JPH031227A (en) Sort processor
JPH06274617A (en) Median filter processing method
JPH03154920A (en) High speed sort processing system
JPH0244499A (en) Two event correlation analyzing system