QuickSort in Action - Sorting Strings

(Page 6 of 6 )

I have demonstrated Quicksort using letters of the alphabet. The same function works very well with strings. To sort the list, {camera, pot, man, woman, can, people, children, girls, boys, umbrella} replace the array elements of the code as follows:

theList[0] = 'camera';

theList[1] = 'pot';

theList[2] = 'man';

theList[3] = 'woman';

theList[4] = 'can';

theList[5] = 'people';

theList[6] = 'children';

theList[7] = 'girls';

theList[8] = 'boys';

theList[9] = 'umbrella';

Run the program, and you should see the sorted elements as:

boys, camera, can, children, girls, man, people, pot, umbrella, woman

Conclusion

Quicksort is a recursive function. It splits the main list into three sub-lists: the left sub-list, the pivot (one element list) and the right sub-list. In my implementation, the left sub-list is always sorted first, before the right sub-list. So, in the function, sorting of the left sub-list is called (written) first; that is “quickSort(arr,leftLeft,leftRight)” is written before “quickSort(arr,rightLeft,rightRight).” Quicksort is very efficient for time-critical client applications.

DISCLAIMER: The content provided in this article is not warranted or guaranteed by Developer Shed, Inc. The content provided is intended for entertainment and/or educational purposes in order to introduce to the reader key ideas, concepts, and/or product reviews. As such it is incumbent upon the reader to employ real-world tactics for security and implementation of best practices. We are not liable for any negative consequences that may result from implementing any information covered in our articles or tutorials. If this is a hardware review, it is not recommended to open and/or modify your hardware.

Comments On: QuickSort in Action

· Thanks for stopping by to read my article. If you have any comments, questions, or...   >>> Post your comment now!