Skip to main content

Command Palette

Search for a command to run...

Time complexity

Published
1 min read
Time complexity
X

"I am currently a Software Engineering student at ALX. I'm passionate about technology and enjoy conducting research to find answers on my own. I have a natural inclination to ask 'WHY' more often than 'HOW'.

"While working on projects at ALX, I have acquired a wealth of interesting and diverse knowledge about software engineering and computer science in general. Therefore, I needed a place to store and save all this information, allowing me to refer back to it whenever I forget."

Time complexity is a measure of the amount of time required for an algorithm to solve a problem as a function of the size of the input. It refers to the number of operations performed by the algorithm, relative to the size of the input.

More from this blog

PERSONAL BLOG

110 posts

Use the search button to search for a specific topic or keyword *all posts are updated on the go*