weekly updates: JavaScript and Algos learning (03/30/2022)

  • So, loops are linear time in algorithms when counting Big O. Another Udemy course to deepen my algorithm and data structures knowledge.
  • Ways to exit out of a loop using “break”. Example of making our code more efficient.
  • Big O(n) is linear time.
  • Data Structures — are ways to store data.
  • Algorithms — are ways to use data structures to write our programs.
  • Programs — are instructions for our machines/computers.
  • Good code should be both readable and scalable.
www.bigocheatsheet.com
Big O Cheat Sheet breakdown by Andrei Naegoi

--

--

--

multilingual Software Engineer, always learning and growing.

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Rails Project…Again

Ten Reasons Why You Should NOT be a Software Developer

Decoding the Encodings (2) — Bringing the world together!

Spark: Aggregating your data the fast way

On Organizing

Working with Unity’s NavMesh System

Load Testing Using JMeter

Alexa controlled Raspberry Pi via node-RED

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Toni T Diep

Toni T Diep

multilingual Software Engineer, always learning and growing.

More from Medium

weekly updates: learning algos & JS backend[3/10/2022]

A Beginner’s Guide to Linked Lists

Fibonacci Algorithm Different Solutions in JavaScript

Validate Binary Search Tree