7 things about big o notation you must be aware of in 2023?

Big O notation is one of the most fundamental tools to analyze the cost of an algorithm.

Big O notation is used to represent the time complexity of an algorithm.

[{"selector":"#anim-6be2f5ed-4001-4469-86b0-793e578cea22","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-d1a56bda-8c1b-4eff-94dc-0570d8d001f9","keyframes":{"transform":["translate3d(0px, -490.01746%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.

[{"selector":"#anim-2cd3b0ad-b74e-4535-8958-956fbf1e62de","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-9f6e714f-9797-4d81-850e-e1c89ae36766","keyframes":{"transform":["translate3d(0px, -397.65356%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Big-O is about finding the Asymptotic upper bound or the worse case runtime.

[{"selector":"#anim-051f2bed-398c-4857-ad1c-a2d520f962fc","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-09522887-9046-4de5-a804-03c2353f5580","keyframes":{"transform":["translate3d(0px, -490.01746%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Asymptotic analysis helps to analyze the algorithm performance change in the order of input size.

[{"selector":"#anim-1011d4af-ee33-4bd8-8d75-587a8a138b9f","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-4fde62d1-6bf4-4ed5-b337-151d7a95b766","keyframes":{"transform":["translate3d(0px, -400.75914%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Big O Notation in Data Structure is used to express algorithmic complexity using algebraic terms.

[{"selector":"#anim-22aa79b6-110b-4e7e-ba06-568ac1055171","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-7676f767-95bb-49dc-998d-1e9005dde331","keyframes":{"transform":["translate3d(0px, -400.75914%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

Understanding of algorithms like Big O helps you to decide what does or does not matter when designing algorithms.

[{"selector":"#anim-c077150f-6a69-4545-95ac-21ea1050695d","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-01808cef-1a03-4e24-8b0e-e8c37c3f0019","keyframes":{"transform":["translate3d(0px, -341.86711%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]

7 things about the MLOps engineer role you must know

[{"selector":"#anim-859472d5-8579-4a22-84e3-dc5f96857acf","keyframes":{"opacity":[0,1]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-b27de6ea-d57d-4630-8f62-4aa764c8cf4b","keyframes":{"transform":["translate3d(0px, -491.55978%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":600,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}]