Write a new version of the chapter's BubbleSort PROC (you can include all appropriate efficiency improvements discussed in the quizzes and other labs) which can sort an array of null-terminated strings.

As always, document any procedures you create well!


This assignment is Level 2.

Options

Add (Level 2) to also write an insertion sort version.

Add (Level 1.5) to write a binary search that works to find a string in an ordered array of strings. Add another (Level 1) to use this PROC in your insertion sort.

Add (Level 2.5) to also write a heap sort version.

Add (Level 2) to allow the caller to specify ascending or descending order for the data to be in.

This option can be used for each of the three sorts above. You get full levels on the first use and half levels on each subsequent use.

Add (Level 1) to write an auxilliary PROC that will check if an array is in order and return T/F in a flag. Use this PROC so your Heap or Insertion sort PROC will be O(n) when the array is already sorted. (This doesn't apply to BubbleSort since you should already have done that.)