Hi Oscar. I really like the series. Your explanations are very clear and very useful for a visual learner like me. Thanks a lot. I have a question about the term "linear order". Does that refer to run time complexity? If so, isn't it actually logarithmic as the search space is shrinking down by a factor?
That is referring to order of convergence ruclips.net/video/JTinepDn1dI/видео.html which is kinda related to time complexity but counterintuitively. Definitely check out the linked video for more info especially how it relates to big-O.
Good question. The mathematician would say this is numerical analysis while a computer scientist would call it a numerical algorithm. They're opposite sides of the same coin.
Basically any language. The example program I wrote, available on GitHub, is written in Pascal. Most of the examples for these videos are in different languages.
Probably the best video on RUclips for this topic.
Hi Oscar. I really like the series. Your explanations are very clear and very useful for a visual learner like me. Thanks a lot.
I have a question about the term "linear order". Does that refer to run time complexity? If so, isn't it actually logarithmic as the search space is shrinking down by a factor?
That is referring to order of convergence ruclips.net/video/JTinepDn1dI/видео.html which is kinda related to time complexity but counterintuitively. Definitely check out the linked video for more info especially how it relates to big-O.
@@OscarVeliz Ah thanks. Will do that.
Awesome explanation.
OK. I get it now. Thanks.
Great ❤
Is this for programming, or is it for math's sake?
Good question. The mathematician would say this is numerical analysis while a computer scientist would call it a numerical algorithm. They're opposite sides of the same coin.
@@OscarVeliz so it works both ways then. What programming would this be apart of any of them or C+?
Basically any language. The example program I wrote, available on GitHub, is written in Pascal. Most of the examples for these videos are in different languages.