1 / 14

colophon

colophon. Or “What I did early 2010”. Experiments with 25 ≤ n ≤ 100, d=10. Reflect on this …. You know that sorting is at best O(n.Log(n)) You know that when you increase the size of the data set (n) run time increases This is kind of what we assume: increase n, increase run time

stuart
Download Presentation

colophon

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. colophon

  2. Or “What I did early 2010”

  3. Experiments with 25 ≤ n ≤ 100, d=10

  4. Reflect on this … You know that sorting is at best O(n.Log(n)) You know that when you increase the size of the data set (n) run time increases This is kind of what we assume: increase n, increase run time Is it not strange that in numPart as we increase n runtime eventually falls?

More Related