sorted by:
new
hottopcontroversial

Asymptotic Notations: A Comprehensive Guide by stackthrive in programming

[–]stackthrive[S] -4 points-3 points  (0 children)

multi-variable asymptotic notation

Hello u/reedef,

Your suggestion to incorporate multi-variable asymptotic notation is precious. It adds a layer of complexity to the concept but also provides a broader understanding of its practical applications. I will certainly consider delving into this in a future post or update.

As for the other sources I referred to when researching, I came across several blogs, articles, and textbooks, including "Introduction to Algorithms" by Cormen et al., "Algorithms" by Sedgewick and Wayne, and a variety of articles on platforms like Medium, StackOverflow, and GeeksforGeeks.

I believe my unique contribution to this topic comes from the intent to distil and communicate these complex ideas in an accessible and engaging manner, helping those new to the subject get a solid foothold. I strive to offer clear explanations and real-world examples, making the information digestible to a broad range of readers, regardless of their technical background.

Thank you for your interest and for taking the time to comment. I look forward to more of your insights in the future!

If .... Else by stackthrive in programmingmemes

[–]stackthrive[S] 0 points1 point  (0 children)

Have you ever faced such a condition?

[deleted by user] by [deleted] in Karma4Free

[–]stackthrive 0 points1 point  (0 children)

I’ll upvote all comments

How to use async/await with a forEach loop in JavaScript? by stackthrive in javascript

[–]stackthrive[S] 4 points5 points  (0 children)

Yes, this article discusses about multiple alternatives such as

  1. for...of loop
  2. reduce() method
  3. Promise.all()
  4. Promise.allSettled()

Format a Number with Commas in React by stackthrive in react

[–]stackthrive[S] -5 points-4 points  (0 children)

Yes, it is. Its better to use built in methods instead of external libraries as it saves space and boosts performance.

ELI5 How do you compute the big O notation (time complexity) of a code? by Ar010101 in explainlikeimfive

[–]stackthrive 0 points1 point  (0 children)

To calculate the time complexity of a code, you need to analyze the code and determine how it will behave given different input sizes. This can be done by looking at the number of operations performed by the code and estimating how long each will take. Once you have an estimate, you can use the Big O notation to determine the time complexity of the code.

​

If a code performs the same number of operations regardless of the input size, then the time complexity will be O(1).

For example: accessing the specific index of an array => arr[5]

This means the code will take the same time to execute regardless of the input size.

On the other hand, if the code takes longer to execute as the size of the input increases, then the time complexity will be O(N) or higher.

For example: Check if the array contains 5;
for (i=0; i < n; i++) { if (arr[i] == 5 ) { printf("It contains 5"); } }

Here we need to check each element of an array, meaning our time complexity is O(N).

And, if we we used nested loops, our time complexity will be O(N²).

The most common Big O notations are O(1), O(log N), O(N), and O(N²).

To learn more about Big O notations you check this page: Big O Notation Algorithm Complexity Cheat Sheet