Internship Experience: Sorting Competition with the Boss

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
233 views
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Apr 20, 2009

I fix a sorting problem, but my boss and I end up in a little bit of a competition which he eventually wins. (Times in the video are approximate.)
Original program used "bubble sort"
I wrote a binary tree sort.
He wrote (I think) a quick sort.
I modified my binary tree sort to randomize the indices before sorting.
He wrote (I think) a merge sort and won, by reducing the time to sort the database from about 29 hours to about half an hour.

Category:

Education

Tags:

License:

Standard YouTube License

  • likes, 0 dislikes

Link to this comment:

Share to:
see all

All Comments (3)

Sign In or Sign Up now to post a comment!
  • I never took Cobol, but did write a program in it once - agonizing.

  • "I remember the 29 hour jobs. heh "

    The thing was that this sort had to be run every day!

  • I remember the 29 hour jobs. heh

  • We had a little class assignment in Cobol (last century) to sort 3 numbers in A,B,C and when done A being smallest, C largest. I was surprised at how much thought had to go into doing this simple little exercise.

    But then it was Cobol :)

  • Correct ... about 81 or 82, I think.

  • I am guessing this was before Numerical Recipes came out in 1986. Since then I have never tried to beat Quicksort.

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more