English 中文(简体)
了解算法的前提条件? [闭门]
原标题:Prerequisites for understanding algorithms? [closed]
最佳回答

我认为,这在很大程度上取决于你想要使用哪一种算法,以及你想要理解这些算法的深度。

  • 对通常的基本数据结构的了解几乎不需要数学背景。

  • 大部分制图学算法要求了解三角学和空间地貌。

  • 如果您有某种物理基础,那么有关物理发动机的天文学就更容易理解。

  • 如果你想要你的方案帮助你作出决定,你可能需要研究实际巨大的数学分领域,其中包括图表理论、游戏理论、选择(包括分析和分界线)

无论如何,具有逻辑/主题思维显然有助于了解和检查/证实你的法典能够/无法发挥作用。

问题回答

如果你再谈论简单的方案,那么实际上就不需要很多数学。 就此而言,你的解决问题和逻辑能力更为重要,但有必要利用流程图和流程规划,在解决问题的基本方面得到指示。

另一方面,人们知道数学可以提高你的能力,在某些领域,你需要了解数学才能取得预期结果。 例如,建立了解线性黄色的动画发动机,其物理作用就更大。





相关问题
How to add/merge several Big O s into one

If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...

Grokking Timsort

There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...

Manually implementing high performance algorithms in .NET

As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...

Print possible strings created from a Number

Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...

Enumerating All Minimal Directed Cycles Of A Directed Graph

I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...

Quick padding of a string in Delphi

I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...

热门标签