Assertion: algorithm's operation | /r/CapableOf | leave about 30 million operations
Facets:
Source sentences:
text: Evaluating the DFT's sums directly involves N2 complex multiplications and N(N − 1) complex additions, of which O ( N ) {\displaystyle O(N)} operations can be saved by eliminating trivial operations such as multiplications by 1, leaving about 30 million operations.