And using the text plus these archive notes,I think you will be able to piece together what you need.
使用这个课本,再加上存档笔记,我想,你们已经能组合出你们需要的了。
So again, I put in numcalls this num calls, which you can ignore.
所以再一次我会加上,这个,你们可以忽略这个。
I'm going to just put that in, and it's the cosine of the number times i plus sine of the number times j times R.
我要在式子加入这个量,这个式子就等于这个值的余弦乘以 i,加上这个值的正弦乘以 j 再乘以常数 R
If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?
如果我用归并排序算法,对N个元素其运行时间,就等于此算法一半元素的运行时间,另一半的运行时间,再加上N,这个N是什么呢?
应用推荐