website: uwu,,,im sowwy, but pweaese...wiww you pwease tuwn off ad bwock? we weawwy need ouw money (´･ω･`)

me: ok [turns off adblock]

website: 𝐃𝐎𝐖𝐍𝐋𝐎𝐀𝐃 𝐂𝐔𝐍𝐓 𝐖𝐀𝐑𝐒 𝐓𝐎𝐃𝐀𝐘 𝐇𝐀𝐕𝐄 𝐇𝐀𝐑𝐃𝐂𝐎𝐑𝐄 𝐒𝐄𝐗 𝐖𝐈𝐓𝐇 𝐓𝐇𝐄𝐒𝐄 𝐂𝐀𝐑𝐓𝐎𝐎𝐍 𝐆𝐈𝐑𝐋𝐒 𝐈𝐍 𝐀 𝐕

Microsoft
(　^ω^)

The way how cables are laid in my workplace... \(°Ω°)/

Long weekend begins yay!

　　　　　　　＿
　　　⋀⋀　　 /　|
　＿/(・ω・)／●. |
!/　.}￣￣￣ 　　/
i＼_}／￣|＿_／≡＝
　　`￣￣~❤
　　　　　　～❤
　　　　　　　　～❤
　　　　　　　　　　～❤
　　　　　　　　　　　　～❤

You're so slow that your hash function takes Ω(n) to execute.

What if Brian Kernighan was just trying to say "Hell O world" and we misinterpreted as hello world

(¬ω¬)

Fun way to confuse the non-tech people in my dorm... Making magnets out of some stuff I’ve fixed 📱

I'm not getting kicked out of school! Yaaaaaay!

I've got a lot of work to do this summer but I know I can do it (｀・ω・´)b

@dfox I reccomend adding on devrant a thing calles hide read or similar feature. When I browse devrant there are times most of my feed is stuff I already saw. I want to be able to filter it. A good app that uses well the feature "Hide Read" is Sync for Reddit. Thx!(　^ω^)

I think I'm overthinking this sigh

But its bothering me a lot so pls help, the two paragraphs I've marked, are they both saying the same thing in different ways?

I don't understand them saying there will be a f(n), when runtime is O(n²), upper bounding the runtime and on the other hand saying for runtime Ω(g(n)), g(n) directly lower bounds the runtime.

(The book is CLRS btw)