From: W. Trevor King Date: Thu, 16 Sep 2010 02:52:36 +0000 (-0400) Subject: Cleaned up src/sorting/. X-Git-Url: http://git.tremily.us/?p=parallel_computing.git;a=commitdiff_plain;h=91f2bd5dd05e5e0ce3730274934dea52d795a661 Cleaned up src/sorting/. --- diff --git a/content/sorting_algorithms/index.shtml b/content/sorting_algorithms/index.shtml index f3b8a9d..e639763 100644 --- a/content/sorting_algorithms/index.shtml +++ b/content/sorting_algorithms/index.shtml @@ -41,9 +41,9 @@ data points.

use bubble sorting in production code.

Nevertheless, here is a simple implementation of the bubble sort -algorithm. The code bubble.c generates a -list of random numbers which are then ordered. The bubble sort -algorithm is certainly the easiest to implement and therefore the +algorithm. The code bubble.c +generates a list of random numbers which are then ordered. The bubble +sort algorithm is certainly the easiest to implement and therefore the easiest to parallelize.

Parallel Bubble Sort

@@ -82,11 +82,12 @@ random to totally ordered.

sorted. -

quicksort.c implements this -algorithm.

+

quicksort.c implements +this algorithm.

The merge component of this parallel implementation is the hardest -to code. The data set multi_lists, which +to code. The data +set multi_lists, which contains three short lists, can be used to practice with.

Parallel Quicksort Algorithm

@@ -102,6 +103,9 @@ worker nodes.

References

+The examples from this section are bundled in +sorting.tar.gz. +