DEV Community

Discussion on: Tell me a stupid app idea and I'll make it

Collapse
 
sorincostea profile image
Sorin Costea

An app to generate stupid app ideas.

Collapse
 
stevenally profile image
......

Ha ha. But no need. He just needed to post the question.

Just goes to show an app is not always the solution...

Collapse
 
icetagchuan profile image
Icetagchuan

Sounds interesting... maybe this app can be a place that place all stupid ideas.

Collapse
 
virejdasani profile image
Virej Dasani

I made a few of the app ideas πŸ‘‡
youtube.com/watch?v=ndmzLQPbg7s

Collapse
 
virejdasani profile image
Virej Dasani

I made a few of the app ideas πŸ‘‡
youtube.com/watch?v=ndmzLQPbg7s

Collapse
 
wiseai profile image
Mahmoud Harmouch • Edited

I think I am taking this comment too seriously. To my humble understanding, you just gave a recursive answer. Meanwhile, the author is trying to solve iteration n, and you just wrote the iteration n+1. Additionally, solving that iteration would introduce another level of complexity to the equation since the formula for generating stupid ideas is unknown, probably meant by "stupid," "random" ideas. And that would be easier. Do you know what I mean?

Edit: Nevermind. Just lost my mind for a split second.

Collapse
 
ajinspiro profile image
Arun Kumar

i wonder how the big(o) would be for that

Thread Thread
 
wiseai profile image
Mahmoud Harmouch

Great question. Ok. Let's say that, hypothetically, and for the sake of the argument that the previous comment gives an additional iteration to reach the base case, which leads to the function being called recursively n+1 times before reaching its base case, which is, again hypothetically, a big fat O(n + 1), that is presumably often called a linear runtime function. And that, in its turn, will lead us to the following formula:

Complexity = length of the tree from root to virgin node * number of virgin nodes
Enter fullscreen mode Exit fullscreen mode

Let's assume now that, theoretically, this equation can dramatically help us understand how to calculate any time complexity, which begs the question: what would that even mean? Now let's state that this equation is valid for the sake of the argument, and let's run quantum experimentation on that basis. Based on SchrΓΆdinger's dog, which is a thought experiment that illustrates a paradox of quantum entanglement. And suppose you are not aware of that thought experiment. In that case, a hypothetical dog may be considered simultaneously both exist and not exist due to its fate being linked to a random subatomic event that may or may not occur. And after a relatively short amount of time, you would manage to figure out the time complexity of that equation. After running that experiment, I think you would agree with me.

Thread Thread
 
virejdasani profile image
Virej Dasani

I made a few of the app ideas πŸ‘‡
youtube.com/watch?v=ndmzLQPbg7s

Collapse
 
virejdasani profile image
Virej Dasani

I made a few of the app ideas πŸ‘‡
youtube.com/watch?v=ndmzLQPbg7s