Non-monotonic time complexity algorithm?

The discrete Fourier transform comes to mind; if it was applied as follows it would be non-monotonic (and discontinuous).

The discrete Fourier transform comes to mind; if it was applied as follows it would be non-monotonic (and discontinuous): if is_power_of_2(len(data)): return fft(data) return dft(data) since dft runs in O(N**2) and fft runs in O(N log N). Designing an algorithm, one would probably find a way to pad the input data to remove non-monotonic behavior (i.e. Accelerate smaller inputs), as is commonly done with fft.

I don't know what you mean by 'asymptotic approximation', but theoretically, it is easy to construct such 'algorithm'... var l = non_monotonic_function(input. Size); for (var I = 0; I.

Real algorithms like this, but just off the top of my head, in pseudo code: void non_monotonic_function(int n) { System. Wait( Math. Sin(n) ); } This algorithm isn't asymptotic as n goes to infinity.

I think this would be O(1) – ThomasMcLeod Feb 3 at 23:20 1 Or more precisely, theta(1) – ThomasMcLeod Feb 3 at 23:20 Yeah, I guess your correct. It is bounded above and below by the a constant function. – Jeffrey Greenham Feb 3 at 23:24.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.