The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
1.3.3 Median and Selection Go to the corresponding chapter in the book About the Book Send us Mail Go to Main Page This page last modified on Tue Jun 03, 1997 . file:///E|/WEBSITE/FILES/MEDIAN03.HTM (2 of 2) [19/1/2003 1:37:03]
1.3.1 Sorting 1.3.1 Sorting INPUT OUTPUT Input Description: A set of n items. Problem: Arrange the items in increasing order. Implementations ● Handbook of Algorithms and Data Structures (Pascal) (rating 7) ● Moret and Shapiro's Algorithms P to NP (Pascal) (rating 7) ● Xtango and Polka Algorithm Animation Systems (C++) (rating 6) ● Algorithms in C++ -- Sedgewick (C++) (rating 5) ● Netlib / TOMS -- Collected Algorithms of the ACM (FORTRAN) (rating 4) ● Nijenhuis and Wilf: Combinatorial Algorithms (FORTRAN) (rating 3) ● Combinatorica (Mathematica) (rating 2) file:///E|/WEBSITE/FILES/SORTING2.HTM (1 of 2) [19/1/2003 1:37:03]
- Page 1131 and 1132: 1.4.5 Transitive Closure and Reduct
- Page 1133 and 1134: About the Book -- The Algorithm Des
- Page 1135 and 1136: About the Book -- The Algorithm Des
- Page 1137 and 1138: Genocop -- Optimization via Genetic
- Page 1139 and 1140: 1.2.6 Linear Programming ● Knapsa
- Page 1141 and 1142: 1.2.7 Random Number Generation ●
- Page 1143 and 1144: 1.3.10 Satisfiability ● Constrain
- Page 1145 and 1146: Qhull - higher dimensional convex h
- Page 1147 and 1148: 1.6.5 Nearest Neighbor Search 1.6.5
- Page 1149 and 1150: 1.6.7 Point Location 1.6.7 Point Lo
- Page 1151 and 1152: 1.6.10 Medial-Axis Transformation 1
- Page 1153 and 1154: 1.6.3 Triangulation 1.6.3 Triangula
- Page 1155 and 1156: Nijenhuis and Wilf: Combinatorial A
- Page 1157 and 1158: 1.5.5 Hamiltonian Cycle 1.5.5 Hamil
- Page 1159 and 1160: 1.4.6 Matching 1.4.6 Matching INPUT
- Page 1161 and 1162: A compendium of NP optimization pro
- Page 1163 and 1164: 1.6.9 Bin Packing 1.6.9 Bin Packing
- Page 1165 and 1166: 1.6.12 Simplifying Polygons 1.6.12
- Page 1167 and 1168: 1.6.13 Shape Similarity 1.6.13 Shap
- Page 1169 and 1170: 1.6.11 Polygon Partitioning 1.6.11
- Page 1171 and 1172: 1.4.3 Minimum Spanning Tree 1.4.3 M
- Page 1173 and 1174: 1.6.15 Maintaining Line Arrangement
- Page 1175 and 1176: 1.3.7 Generating Graphs 1.3.7 Gener
- Page 1177 and 1178: 1.2.11 Discrete Fourier Transform 1
- Page 1179 and 1180: 1.5.8 Edge Coloring 1.5.8 Edge Colo
- Page 1181: 1.3.3 Median and Selection 1.3.3 Me
- Page 1185 and 1186: Plugins for use with the CDROM Plug
- Page 1187 and 1188: Implementation Challenges Next: Dat
- Page 1189 and 1190: Implementation Challenges Next: Gra
- Page 1191 and 1192: Implementation Challenges Next: Int
- Page 1193 and 1194: Caveats Next: Data Structures Up: A
- Page 1195 and 1196: 1.1.1 Dictionaries ● Priority Que
- Page 1197 and 1198: 1.1.4 Graph Data Structures ● Gra
- Page 1199 and 1200: 1.1.5 Set Data Structures ● Gener
- Page 1201 and 1202: 1.2.1 Solving Linear Equations ●
- Page 1203 and 1204: 1.2.2 Bandwidth Reduction ● Topol
- Page 1205 and 1206: 1.2.4 Determinants and Permanents
- Page 1207 and 1208: 1.2.8 Factoring and Primality Testi
- Page 1209 and 1210: 1.2.9 Arbitrary Precision Arithmeti
- Page 1211 and 1212: 1.2.10 Knapsack Problem ● Linear
- Page 1213 and 1214: 1.3.2 Searching ● Sorting Go to t
- Page 1215 and 1216: 1.3.4 Generating Permutations ● C
- Page 1217 and 1218: 1.3.5 Generating Subsets ● Genera
- Page 1219 and 1220: 1.3.6 Generating Partitions ● Gen
- Page 1221 and 1222: 1.3.8 Calendrical Calculations Go t
- Page 1223 and 1224: 1.3.9 Job Scheduling ● Feedback E
- Page 1225 and 1226: 1.4.2 Topological Sorting Related P
- Page 1227 and 1228: 1.4.8 Edge and Vertex Connectivity
- Page 1229 and 1230: 1.4.10 Drawing Graphs Nicely ● Pl
- Page 1231 and 1232: 1.4.11 Drawing Trees ● Planarity
1.3.1 Sorting<br />
1.3.1 Sorting<br />
INPUT OUTPUT<br />
Input Description: A set of n items.<br />
Problem: Arrange the items in increasing order.<br />
Implementations<br />
● Handbook of <strong>Algorithm</strong>s and Data Structures (Pascal) (rating 7)<br />
● Moret and Shapiro's <strong>Algorithm</strong>s P to NP (Pascal) (rating 7)<br />
● Xtango and Polka <strong>Algorithm</strong> Animation Systems (C++) (rating 6)<br />
● <strong>Algorithm</strong>s in C++ -- Sedgewick (C++) (rating 5)<br />
● Netlib / TOMS -- Collected <strong>Algorithm</strong>s of the ACM (FORTRAN) (rating 4)<br />
● Nijenhuis and Wilf: Combinatorial <strong>Algorithm</strong>s (FORTRAN) (rating 3)<br />
● Combinatorica (Mathematica) (rating 2)<br />
file:///E|/WEBSITE/FILES/SORTING2.HTM (1 of 2) [19/1/2003 1:37:03]
Change language