TWIST 'n SORT 旋转排序玩具
Now, it's kind of a cyclical argument here because how do you sort the left half of N elements?
在这儿有点循环的意思,那么如何对N个元素中的左半部分进行排序呢?
Merge sort has o (n log n) worst-case and average-case performance.
合并排序的最差性能和平均性能为o (n log n)。
Favored by edgy designers like Number (N)ine, Undercover and Rick Owens, the trend included hooded jackets, big coats and some sort of bizarre headgear, perfect for hiding from the paparazzi.
许多前卫设计师都钟情于此,如Number (N)ine,Undercover和Rick Owens。 这一潮流的特点是兜帽夹克或宽大外套,以及各种诡异的、正好可以躲过狗仔队的帽子。
N But it's definitely not one and in fact it wasn't N in the case of Selection Sort because remember the algorithm we implemented on stage last week had me going back and forth across the stage selecting on iteration, the smallest person I can find, the smallest number and then putting them into place.
但在选择排序中,肯定不会是1,也不是,注意,上周我们在这儿,实现的算法中,反复地,迭代进行选择,选出最小的数,然后将其放在合适的位置。
If we can sort things, you know, we get this n log n behavior, and we got a n log n behavior overall. But can we actually do better in terms of searching.
如果我们可以排序,如你所知,我们有n,log,n级别的算法,并且我有一个整体的n,log,n级别的算法,但是我们在搜索方面可以做的更好吗?
Like what the heck have we been spending our time for-- our time on with Bubble Sort and with Selection Sort and in fact there's plenty of other N squared sorts that we're not even gonna bother looking at.
真见鬼,我们竟然在-,冒泡排序和选择排序上花时间,而事实上,还有很多我们根本都不想考虑的,复杂度为N平方的排序方法。
应用推荐