Sorting Logic and Flowcharts, Research Paper Example

Bubble Sort

Bubble sort works by continually marching through a list, comparing two items, and exchanging them if they are not in order. An algorithm follows (Nguyen, 2009).

• Get length of list : N, array list[1],list[2],…,list[N]
• M ? N
• If M < 2 then print the list, stop
• M ? M – 1, i ? 0
• Increase i by 1
• If i > M goto 1
• If list[i] > list[i+1] swap list[i] and list[i+1]
• Goto 5.

Bubble Sort Flowchart

(Nguyen, 2009)

Bubble Sort Data Logic (Nguyen, 2009)

• Start
• Get length (list) and list elements
• For each M in length (list) down to 1 do:
• For each i (1 to M-1) do;
• If list [i] > list [i+1] then
• Swap (list [i+1], list [i])
• End if
• End for
• End for
• Print, End process

Quick Sort

The 2-way algorithm is shown here (Martin, D. R. (2007). Two sorts are performed smultanteously.

 # choose pivot

swap a[1,rand(1,n)

# 2-way partition

k = 1

for i = 2:n, if a[i] < a[1], swap a[++k,i]

swap a[1,k]

# recursive sorts

sort a[1..k-1]

sort a[k+1,n] 

Quick Sort Flowchart 

(Betounes, 2012)

Quick Sort Data Logic

(Algorithms, 2012).

References

Algorithms and Data Structures. (2012). Retrieved from http://www.algolist.net/Algorithms/Sorting/Quicksort

Betounes, D. (2012). Flow Chart for Quick Sort Algorithm. Retrieved from http://davidbetounes.com/nsf-ili/mcdisplay.htm

Martin, D. R. (2007). Quick Sort. Retrieved from http://www.sorting-algorithms.com/quick-sort

Nguyen, H. (2009). Computer Systems. Retrieved from http://cnx.org/content/m27733/latest/