A variant of the Ford-Johnson algorithm that is more space efficient (Q846008): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/j.ipl.2006.11.017
-Normal rank
@@ Property / OpenAlex ID @@
-W1998757079
@@ Property / OpenAlex ID: W1998757079 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2006.11.017
+Normal rank
@@ Property / OpenAlex ID @@
+W1998757079
@@ Property / OpenAlex ID: W1998757079 / rank @@
+Normal rank
@@ Property / cites work @@
+Electronic Data Sorting
@@ Property / cites work: Electronic Data Sorting / rank @@
+Normal rank
@@ Property / cites work @@
+A Tournament Problem
@@ Property / cites work: A Tournament Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4507509
@@ Property / cites work: Q4507509 / rank @@
+Normal rank
@@ Property / cites work @@
+The Ford-Johnson Sorting Algorithm Is Not Optimal
@@ Property / cites work: The Ford-Johnson Sorting Algorithm Is Not Optimal / rank @@
+Normal rank
@@ Property / cites work @@
+Merging of 4 or 5 elements with n elements
@@ Property / cites work: Merging of 4 or 5 elements with n elements / rank @@
+Normal rank