There is a big reason why so many men and women are unable to use diets like paleo or keto, doctor’s visits, metabolic supplements, etc., to lose weight.
If even 1 of these 5 hormones is out of balance, they’ll literally block our body from metabolizing fat cells...
00:00 Contents
00:25 Y=A Sin(wt) – describing Sine Wave features
00:45 The unit circle
01:11 Sine values for radians and degrees in a right-angled triangle
02:38 Y=A Sin(wt) – describing Sine Wave features
03:17 Understanding Omega (Angular velocity)
04:02 Animation of Sine Function, Unit Circle where f=1Hz
04:37 How Omega affects a Cartesian Sine graph, with formulae
05:58 How Omega affects wavelength, frequency and period
07:48 Visualising wt as an angle – two equations to choose
08:41 Visualising wt with frequency
09:13 Visualising wt with period / time
10:25 real-time animations as w Omega changes
11:36 Converting between radians and degrees (and vice versa)
12:10 Tips regarding engineering trig
13:06 Understanding phase and phase difference / phase shift Video Rating: / 5
#physicsmanibalan Acceleration is double differentiation of angular displacement Video Rating: / 5
Join Our Class (taking limited students): https://codinginterviewclass.com
Come Visit Us: https://backtobackswe.com/brand
Practice Time & Space Complexities: https://thebigoguide.com
Join Our Facebook Group: https://www.facebook.com/groups/backtobackswe
Great Resource: https://cathyatseneca.gitbooks.io/data-structures-and-algorithms/content/analysis/notations.html
Big O Cheat Sheet: http://bigocheatsheet.com
Today we will initiate a discussion on something that I have lied to you about for a very long time. This will be as simple as possible.
We will not only consider the informal definition but rather also look at the mathematical understandings behind why we call these asymptotic “bounds”.
Again, we care about this because the true colors of an algorithm can only be seen in the asymptotic nature of runtime and space.
So imagine this, we have these components:
A function T(n) which is the actual number of comparisons, swaps…just…resources an algorithm needs in terms of time or space. It is a function of n. When n changes, T(n) changes.
Our job is to classify behaviour.
A bound O( f(n) ) is the function that we choose to apply for the specific bounding.
The definitions, an example:
“T(n) is O(f(n))” iff for some constants c and n0, T(n) less than or equal to c * f(n) for all n greater than or equal to n0
In English…this means…we can say that f(n) is a fundamental function that can upper bound T(n)’s value for all n going on forever.
We have an infinite choice for what c is.
Our constant does not change behavior, it changes “steepness” of the graph.
We are saying that…if I declare f(n) as an upper bound, then I can find a constant c to multiply against f(n) to ALWAYS always always keep T(n) beneath my c * f(n)…T(n) will never beat c * f(n) for infinite n values…hence asymptotic bounding.
If we can’t find this c then f(n) fails as an upper bound because it does not satisfy the asymptotic requirement.
So why are constants dropped?
Well…think about what we just did. The injection of the arbitrary c as a multiple onto a base function removes the need for a constant. It adds no meaning to a bound because it is conceptually already a part of the definition of what a bound is.
Big Bounds
Big O: Upper bound on an algorithm’s runtime
Theta (Θ): This is a “tight” or “exact” bound. It is a combination of Big
For example:
An algorithm taking Ω(n log n) takes at least n log n time, but has no upper limit.
An algorithm taking Θ(n log n) is far preferential since it takes at least n log n (Ω(n log n)) and no more than n log n (O(n log n)).
Big Omega (Ω): Lower bound on an algorithm’s runtime.
Little Bounds
Little o: Upper bound on an algorithm’s runtime but the asymptotic runtime cannot equal the upper bound.
There is no little theta (θ).
Little Omega (ω): Lower bound on an algorithm’s runtime but the asymptotic runtime cannot equal the lower bound.
If you can’t get an exact upper bound, try lower bounding (although it is less useful to be honest).
