SU1312565A1 - Device for sorting numbers - Google Patents

Abstract

This invention relates to automation and computing. The purpose of the invention is to expand the scope by providing the possibility of sorting an array containing equal numbers. The device contains n groups of (n-1) comparison elements, where n is the number of sorted numbers, 2n adders, n memory blocks (for example, ROM), n groups of n subgroups of AND elements and n groups of OR elements. The sorted numbers of comparison elements are compared in pairs each with each. For each of the n numbers, counters count the number E. numbers equal to a; -m, and the number L of numbers, less a-. The values of E and L are fed to the address inputs of the corresponding memory block, which, having formed the signals of logical unity at their respective outputs, opens the elements of And so that the number a. formed at the () th adjacent output of the device, starting with () -ro. 1 il. about S (L 0 JV with U

Description

eleven

The invention relates to automation and computing.

The purpose of the invention is to expand the scope by providing the ability to sort an array containing equal numbers.

The drawing shows a diagram of the device.

The device contains n groups of (n-1) -th element of comparison 1

J ,,.

p, 1 p, a, p-1

1., 1 1.

, ..., (

Claims (3)

one. 0, P-1 sa  p, 1 p, g two groups of n adders IJ i ylllLDl 11 II L111S1 1 JjLJUJO 2-2 and 3 -3, n blocks of memory made, for example, in the form of a ROM, n groups according to n subgroups of elements AND 1.1 n, n (each of which contains m - according to the number of bits of the sorted numbers — I elements) , n groups of elements IL11 6-6, inputs 7-7 of sorted numbers, outputs of sorted. numbers. The device works as follows. Sorted numbers are fed to the inputs 7-7 to the inputs of the elements Comparisons where each pair is compared with each. For each i-th group, where i 1,2, .. ,, n, adder 21 calculates E - the number of numbers equal to the number a received on the i-th input, and adder 3. calculate L j - the number of numbers less than a-. From the outputs with; of the allocators 2 and 3, the values of E and L are fed to the address inputs of the memory block 4, which forms the signal of the logical unit at its () -th output, starting with (C- + 1) -th. As a result, elements AND of the corresponding groups 5 are opened; ..... 55 , b, 4th - - (dm e, - and arrives at the outputs SL ,, .., .., 5 ° cc-2 t, the outputs corresponding to the position of the number a among other sorted numbers, taking into account the possible equality of some numbers from the sorted array. and number a 5 2 Invention Formula A device for sorting numbers containing n groups of (n-1) comparison elements, where n is the number of sorted numbers and the input is q-ro bit i-number of the device, where, 2, ..., n, q 1,2 , ..., m, m is the number of bits of the numbers being compared, connected to the q-m inputs of the first groups of inputs of all elements of the comparison of the 1st group, with the q-m inputs of the second group of inputs (1-1) of the elements of the comparison with the first through (1-1) group and with q-m the inputs of the second groups of inputs of the 1st elements of the comparison with the (1 + 1) -and -th group of the nth group, characterized in that, in order to expand the field of application, by providing the possibility of sorting an array containing equal numbers, it contains the first and the second group of n adders, n memory blocks, n groups of n subgroups of n elements And, n groups of m elements OR, and the output is Equal to the G-th element of the comparison of the 1st group, where I 1,2, ... , (n-1), is connected to the 1st input of the 1st adder of the first group, the pth output of which, where nt, l X is the nearest integer greater than X, connected to the p-th address input of the 1st memory block, output Less than the E-th element of the comparison of the 1st group is connected to the f-M input of the 1st adder of the second group, the p-th output of which is connected to (p-ltop PS) -m address input of the 1st memory block, the j-th output of which, where j 1,2, ..., n, is connected to the first inputs of the AND elements j-subgroups 1st group, the q-ro input of the 1st of the device j is connected to the second inputs of the q-x elements AND all subgroups of the 1st group, the output of the q-ro element AND the 1st subgroup of the j-th group is connected to j-M input q-rc of the element OR of the 1st group, the output of which is the output of the q-ro bit of the 1st sorted number of the device. Compiled by V.Ivanova Editor V.Danko Tehred L.Oliynyk Order 1972/47 Circulation 673 Subscription BNIIPI USSR State Committee for inventions and discoveries 113035, Moscow, Zh-35, Raushsk nab., 4/5 Production printing enterprise, Uzhgorod, st. Project, 4