Essential Programming Versus Time Complexityby@diego-lopez-yse
313 reads
313 reads

Essential Programming Versus Time Complexity

by Diego Lopez Yse8mJanuary 26th, 2020
Read on Terminal Reader
Read this story w/o Javascript
tldt arrow

Too Long; Didn't Read

The Big O notation is a language we use to describe the time complexity of an algorithm. It’s how we compare the efficiency of different approaches to solving a problem. Algorithms with Constant Time Complexity take a constant amount of time to run, independently of the size of n. They don’t change their run-time in response to the input data, which makes them the fastest algorithms out there. The idea behind time complexity is that it can measure only the execution time of the algorithm in a way that depends only on the algorithm itself.

Company Mentioned

Mention Thumbnail
featured image - Essential Programming Versus Time Complexity
Diego Lopez Yse HackerNoon profile picture
Diego Lopez Yse

Diego Lopez Yse

@diego-lopez-yse

Using AI & Data Science to create real social impact. Working in AI? Let's get in touch

Learn More
LEARN MORE ABOUT @DIEGO-LOPEZ-YSE'S
EXPERTISE AND PLACE ON THE INTERNET.

Share Your Thoughts

About Author

Diego Lopez Yse HackerNoon profile picture
Diego Lopez Yse@diego-lopez-yse
Using AI & Data Science to create real social impact. Working in AI? Let's get in touch

TOPICS

THIS ARTICLE WAS FEATURED IN...

Permanent on Arweave
Read on Terminal Reader
Read this story in a terminal
 Terminal
Read this story w/o Javascript
Read this story w/o Javascript
 Lite
L O A D I N G
. . . comments & more!