implementation

I'm in need of some tips regarding a small project I'm doing. My goal is an implementation of a Fast Fourier Transform algorithm (FFT) which can be applied to the pricing of options. First concern: which FFT? There are a lot of different FFT algorithms, the most famous one being Cooley-Tukey. My thoughts on this: I prefer the most simple one, since this is no thesis or big project, just a course on Algorithms. But it has to be compatible with option pricing (in contrast with the most - well in our general literature- referenced application of images/sound processing). So it depends on the form

How can I create a custom array constructor, which is an extended version of the native Array constructor? jQuery, for example, looks like an array with additional methods, such as $().addClass . However, it didn't modify Array.prototype , because new Array().hasClass is undefined . So, how can I create an extended array implementation, without modifying Array.prototype ? Example: Employees( ... ) //-> [{name: 'John', age: 32}, {name: 'Bob', age: 29}]; Employees( ... ).byAge(32)//-> [{name: 'John', age: 32}]; // and Array().byAge //-> undefined jQuery is not a true Array implementation: jQuery

I am reading a file that is filled with hex numbers. I have to identify a particular pattern, say "aaad" (without quotes) from it. Every time I see the pattern, I generate some data to some other file. This would be a very common case in designing programs - parsing and looking for a particular pattern . I have designed it as a Finite State Machine and structured structured it in C using switch-case to change states. This was the first implementation that occured to me. DESIGN: Are there some better designs possible? IMPLEMENTATION: Do you see some problems with using a switch case as I