Entry Woodrum:1969:ISM from ibmsysj.bib
Last update: Thu Nov 27 02:08:39 MST 2008
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Woodrum:1969:ISM,
author = "L. J. Woodrum",
title = "Internal Sorting with Minimal Comparing",
journal = j-IBM-SYS-J,
volume = "8",
number = "3",
pages = "189--203",
year = "1969",
CODEN = "IBMSA7",
ISSN = "0018-8670",
bibdate = "Wed Jan 08 16:35:07 1997",
bibsource = "Compendex database",
note = "See errata \cite{Anonymous:1970:ESM}",
abstract = "Ordering operator that leads to development of
algorithm for internal sorting is described; analysis
of algorithm is presented, together with discussion of
number of comparisons necessary for sorting; it is
shown that number of comparisons is close to
theoretically obtainable number; sorting algorithm is
variant of two-way merge.",
acknowledgement = ack-nhfb,
journalabr = "IBM Systems J",
keywords = "computers; programming",
}
Related entries
- Anonymous:1970:ESM,
9(2)163
- close,
32(4)612,
35(2)244
- comparing,
9(2)163,
17(1)26,
21(1)31,
23(2)126,
42(1)129
- comparison,
8(4)252,
13(1)32,
21(1)31,
29(2)236,
33(3)445,
40(2)442
- discussion,
2(1)86,
12(3)238,
13(3)186,
15(1)53,
16(2)84,
16(2)148,
17(3)206,
18(1)71,
18(1)164,
18(2)202,
18(2)244,
19(2)192,
20(3)294,
20(4)388,
21(1)31,
21(2)131,
21(3)327,
21(4)384,
23(1)19,
23(1)63,
23(2)126,
23(3)224,
23(4)375,
23(4)387,
25(1)36,
25(1)63,
25(2)207,
26(1)37,
28(1)62,
28(3)465,
28(4)613,
29(2)209,
29(2)250,
29(2)274,
30(1)107,
30(4)539,
30(4)582,
31(1)123,
31(2)313,
32(1)162,
32(3)397,
32(4)625,
33(1)220,
33(3)382,
34(1)20,
35(1)37,
35(2)122,
35(2)128
- errata,
4(1)84,
6(1)76-1,
9(2)163,
12(4)351,
13(2)183,
13(3)186,
15(2)174,
43(2)441,
47(3)415,
47(4)709
- internal,
6(1)38,
9(2)163,
12(3)257,
23(1)44,
23(4)336,
25(2)236,
25(3)256,
25(3)274,
28(1)175,
29(3)467,
30(3)280,
31(4)774,
31(4)788,
32(1)4,
46(4)z-11
- lead,
18(1)164,
18(2)202,
23(1)36,
28(1)62,
28(4)600,
30(1)107,
31(4)691,
32(1)17,
33(1)131,
40(2)360
- merge,
23(3)228,
24(3)294
- minimal,
2(0)24,
9(2)163,
34(2)144
- necessary,
10(3)168,
13(3)230,
14(4)340,
17(2)106,
17(2)151,
17(3)290,
19(2)208,
23(1)81,
24(2)91,
24(3)248,
27(3)301,
29(2)189,
29(2)265,
29(3)356,
30(3)259,
31(1)11,
31(1)49,
31(2)252,
31(2)353,
31(4)620,
32(4)612,
33(1)46,
33(2)349,
34(1)39,
34(4)629
- number,
4(1)84,
8(2)136,
8(4)319,
9(2)78,
10(3)168,
11(3)255,
11(4)278,
13(1)2,
13(1)19,
14(2)161,
16(1)54,
16(2)96,
17(1)64,
17(1)82,
21(4)471,
23(3)262,
23(3)264,
25(3)306,
26(1)107,
27(3)264,
27(3)315,
28(1)4,
28(3)407,
28(4)646,
28(4)661,
29(4)526,
30(1)34,
30(3)250,
30(3)312,
30(3)322,
32(1)17,
32(1)111,
32(1)143,
32(4)625,
33(1)20,
33(3)382,
33(3)458,
34(2)292,
34(3)347,
34(3)409,
34(4)552,
34(4)629,
35(1)4,
35(2)122
- obtainable,
29(4)526
- operator,
14(1)35,
14(2)134,
20(4)372,
23(1)129,
30(4)433,
30(4)513,
30(4)554,
30(4)582,
31(2)223,
31(2)252,
33(3)445,
35(1)2
- ordering,
28(4)646,
30(3)250
- see,
9(2)163,
11(2)169,
12(1)109,
12(4)351,
13(2)183,
13(3)186,
13(4)352,
13(4)352-1,
14(2)161,
14(2)188,
14(2)208,
15(1)4,
15(1)24,
15(2)174,
15(3)264,
15(3)270,
15(4)285,
16(1)54,
16(4)421,
16(4)422,
17(1)97,
17(2)202,
17(4)383,
18(1)143,
18(3)470,
18(3)473,
18(4)604,
18(4)605,
23(3)281,
24(1)26,
24(1)71,
25(1)130,
28(2)345,
29(2)209,
29(4)583,
30(2)206,
30(4)598,
31(1)79,
31(2)300,
33(1)220,
35(2)122,
47(1)115,
47(2)351,
47(3)415,
47(4)709
- shown,
8(4)309,
9(3)219,
10(3)168,
14(1)16,
14(2)188,
14(3)272,
15(3)182,
17(3)241,
19(3)314,
21(1)54,
23(1)36,
24(3)248,
24(3)316,
27(4)541,
28(4)569,
31(1)94,
31(2)353,
33(1)182,
34(2)144,
34(3)330
- sorting,
9(2)163,
10(3)244,
16(4)363
- together,
14(4)353,
17(4)359,
18(2)202,
19(4)542,
20(3)306,
23(3)170,
25(1)116,
28(3)376,
29(2)170,
29(3)451,
30(1)72,
31(1)79,
31(2)336,
34(2)185,
36(1)z-4,
41(4)686
- two-way,
28(4)600
- variant,
32(3)486
- way, two-,
28(4)600
- Woodrum, L. J.,
9(2)118
- Woodrum:1969:ISM,
9(2)163