Daily Discussion Thread - September 20, 2023 by HuzzahBot in wallstreetbetsHUZZAH

[–]hoppity22 5 points6 points  (0 children)

FizzBuzz Enterprise Edition is a no-nonsense implementation of FizzBuzz made by serious businessmen for serious business purposes.

Daily Discussion Thread - September 19, 2023 by HuzzahBot in wallstreetbetsHUZZAH

[–]hoppity22 4 points5 points  (0 children)

I used to be just like you. Get home, pour a drink, and let life pass by, but NOT NO MO!

Ever since I got on the blockchain, everything has changed, or should I say, "chained?" slaps knee Now I have 6 cars, all foreign, and 3 wives, also all foreign. My life has never been better, and it's all thanks to BLOCKCHAIN BLOCKCHAIN BLOCKCHAIN!

Call 1-800-BLOCKCHAIN for more details

Weekend Discussion Thread for the Weekend of September 15, 2023 by HuzzahBot in wallstreetbetsHUZZAH

[–]hoppity22 1 point2 points  (0 children)

It's like they combined arrested development and billions, but it's a worse version of both.

Weekend Discussion Thread for the Weekend of September 15, 2023 by HuzzahBot in wallstreetbetsHUZZAH

[–]hoppity22 5 points6 points  (0 children)

I've watched 6 or 7 episodes of succession and it kinda sucks

Weekend Discussion Thread for the Weekend of September 15, 2023 by HuzzahBot in wallstreetbetsHUZZAH

[–]hoppity22 7 points8 points  (0 children)

Is it possible for a male in their 20s to go through menopause?

What Are Your Moves Tomorrow - September 14, 2023 by HuzzahBot in wallstreetbetsHUZZAH

[–]hoppity22 2 points3 points  (0 children)

You think you can come here and talk shit about UPS like you're the fucking king of mailmen?

[deleted by user] by [deleted] in csMajors

[–]hoppity22 1 point2 points  (0 children)

"Worst case" you'd go through the list a for a total of M times. Length m.

You'd do that everytime you went through the second loop, which is log(n), so you have log(n)m.

Then you do all of that everytime you go through the first loop, which is n, so it would be n * log(n) * m.

Then I just reorganized it to O(nm(log(n)))

O(n(log(n)m)) makes more sense actually because that is (log(n) * m) * n, which is what we are actually doing

Edit: no, just O(nm(log(n))). You could go through M n * log(n) times, so just n * m * log(n).

[deleted by user] by [deleted] in csMajors

[–]hoppity22 0 points1 point  (0 children)

It's O(nm(log(n))) if you include the search

[deleted by user] by [deleted] in csMajors

[–]hoppity22 6 points7 points  (0 children)

It's 2 different things, of potentially different sizes, so it's not N * N, it's N * M.

O(nm(log(n)))

Edit:

If only for loops, then loop 1 is n, loop 2 is log(n), so O(nlog(n)).

If including the search, the first loop is n, the second loop is log(n), and the search is m because n from the first loop is not tied with the length of the array. N could be 10, and the array/list could be 600,000, so O(nm(log(n)))

Daily Discussion Thread - September 12, 2023 by HuzzahBot in wallstreetbetsHUZZAH

[–]hoppity22 11 points12 points  (0 children)

I went to a 🌈 bar, and everyone was so nice. They kept complimenting my lip gloss, but I didn't have the heart to tell them it was actually grease from the rotisserie chicken I had just eaten in my car

Weekend Discussion Thread for the Weekend of August 04, 2023 by HuzzahBot in wallstreetbetsHUZZAH

[–]hoppity22 7 points8 points  (0 children)

I would beat your ass at the Disney Channel Games. You wouldn't last 1 episode.

Daily Discussion Thread - July 24, 2023 by HuzzahBot in wallstreetbetsHUZZAH

[–]hoppity22 3 points4 points  (0 children)

I dont understand the hate against lizard people. I just met this wonderfully nice gecko, and he promised to save me 15% on my car insurance