Finding the Time complexity (Big "O") of programs meant to obtain the initial coefficients of a binomial expansion in MQL4.
![MQL5 - Language of trade strategies built-in the MetaTrader 5 client terminal](https://c.mql5.com/i/registerlandings/logo-2.png)
You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
The following three blocks of codes are meant to find the initial coefficients of the expansion of a binomial expression up to power 6. That is, since (x + y)^6 = x^6 + 6x^5y + 15x^4y^2 + 20x^3y^3 + 15x^2y^4 + 6xy^5 + y^6, the program is meant to obtain the numbers 1, 6, 15, 20, 15, 6, 1 given only the input 6. Each block of code represents one of three different methods of finding the numbers. The question is: What are the Time complexity (Big "O") of each block of codes given that the input is 6 in each method? Thank you as I anticipate your answers.
First method - THE USE OF PASCAL'S TRIANGLE
Second method - THE USE OF FACTORIAL
Third method: THE TABULAR METHOD