Notable Question - Badge - Computer Science Stack Exchange

1. Home
2. Questions
3. Tags
5. Users
6. Jobs
7. Companies
8. Unanswered
Teams

Now available on Stack Overflow for Teams! AI features where you work: search, IDE, and chat.
Learn more Explore Teams
Teams
Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams

Notable Question

Question with 2,500 views. This badge can be awarded multiple times.

Olórin

8592 gold badges12 silver badges22 bronze badges

earned this badge 8 times.

Greedy proof: Correctness versus optimality

Awarded yesterday

Does amortized complexity always equal to worst case complexity divided by n?

Awarded Dec 8, 2022 at 2:04

How can I use the NP complexity Venn diagram to quickly see which class of NP problem can be poly reducible to another class?

Awarded Mar 11, 2021 at 10:18

Is the height of the tree the number of edges or number of nodes?

Awarded Mar 11, 2019 at 7:20

What is the complexity of recurrence $T(n) = T(n-1) + 1/n$ [duplicate]

Awarded Feb 11, 2019 at 17:40

Is there a difference between perfect, full and complete tree?

Awarded Apr 19, 2018 at 19:54

When inserting into a binary tree, is there a universal agreed upon place to insert then new node to minimize complexity?

Awarded Jun 3, 2017 at 22:49

Why can the alphabet be represented in numbers in base 256

Awarded Apr 24, 2017 at 21:33

Others with this badge