1. Algorithm Issues

2. Executive Summary Just because you understand the math doesn’t mean the executive wants to hear it. Just because you understand the math doesn’t mean the executive wants to hear it. Talk about Talk about Results Results Benefits Benefits NOT the process NOT the process

3. Passive Voice Abuse It would be recommended that your sorting algorithm be switched to Quicksort. It would be recommended that your sorting algorithm be switched to Quicksort. I recommend that you switch your sorting algorithm to Quicksort. I recommend that you switch your sorting algorithm to Quicksort.

4. Random Good: “Pick an element from the array at random, to use as the pivot point.” Good: “Pick an element from the array at random, to use as the pivot point.” Bad: “The zip codes, currently in random order, can be sorted using…” Bad: “The zip codes, currently in random order, can be sorted using…”

5. Words that aren’t really words … till all the elements are sorted. … till all the elements are sorted. u look 4 u look 4

6. These are not the words you’re looking for. The algorithm will resort the data… The algorithm will resort the data… Deer sir, Deer sir, Zip coed Zip coed

7. Punting the ball Providing a list of resources, for further study? Good. Providing a list of resources, for further study? Good. Giving a URL describing recursion instead of describing it yourself? Bad. Giving a URL describing recursion instead of describing it yourself? Bad.

8. Are these really quotations? The “Quicksort” algorithm will be able to sort your data much faster than the “Bubblesort” algorithm. The “Quicksort” algorithm will be able to sort your data much faster than the “Bubblesort” algorithm.

9. On that note... quicksort, Quicksort, quick sort, Quick Sort quicksort, Quicksort, quick sort, Quick Sort mergesort, Mergesort, merge sort, Merge Sort mergesort, Mergesort, merge sort, Merge Sort bubblesort, Bubblesort, Bubble sort, Bubble Sort bubblesort, Bubblesort, Bubble sort, Bubble Sort Pick one. Stick with it. Pick one. Stick with it.

10. Who are you talking to? First, you take the first element in the array… First, you take the first element in the array… Then we move all the elements less than the pivot point to its left… Then we move all the elements less than the pivot point to its left… Next, move the larger elements to the right… Next, move the larger elements to the right… Finally, the function calls itself recursively. Finally, the function calls itself recursively.

11. Pet peeve: To Be Using Utilizing This algorithm will be using… This algorithm will be using… This algorithm will use… This algorithm will use… This algorithm will utilize… This algorithm will utilize… Again, this algorithm will use... Again, this algorithm will use...

12. “… will sort the zip codes in a well ordered fashion.” “… will sort the zip codes in a well ordered fashion.” No. No. It will sort them in order. It will sort them in order. Be precise. Be precise.

13. Beware of Superlatives Bubble sort is the simplest sorting algorithm, but it is also the slowest. Bubble sort is the simplest sorting algorithm, but it is also the slowest. Quicksort is the fastest sorting algorithm available. Quicksort is the fastest sorting algorithm available.

14. Substantive issues Define recursion. Define recursion. Mergesort: describe both the sorting and the merging. Merging is the more difficult part. Mergesort: describe both the sorting and the merging. Merging is the more difficult part.

15. Provide examples. Walk the reader through the steps, even when some of those steps are repetitive. Provide examples. Walk the reader through the steps, even when some of those steps are repetitive. Not everyone understands a concept the first time. Not everyone understands a concept the first time.

16. Potentially false promises “Mergesort runs 300 times faster than Bubble sort.” “Mergesort runs 300 times faster than Bubble sort.” “Quicksort takes 10 seconds to sort what would take Bubblesort 52 minutes.” “Quicksort takes 10 seconds to sort what would take Bubblesort 52 minutes.”

17. The path to the Dark Side “Merge sort can sort a database of 10,000 entries up to 2,500 times faster than Bubble sort.” “Merge sort can sort a database of 10,000 entries up to 2,500 times faster than Bubble sort.” An executive may not know that O(n*log(n)) time is much, much faster than O(n^2) time. An executive may not know that O(n*log(n)) time is much, much faster than O(n^2) time. But an executive will know that “up to” is potentially bullshit. But an executive will know that “up to” is potentially bullshit.

18. Beware of over-promising: Beware of over-promising: “Once your company switches to Mergesort, your current inefficiencies will disappear and profits will skyrocket.” “Once your company switches to Mergesort, your current inefficiencies will disappear and profits will skyrocket.” Come on, you’re just improving the sorting algorithm. Come on, you’re just improving the sorting algorithm. Don’t assume this sole issue will make or break the entire company. Don’t assume this sole issue will make or break the entire company.