2ndSequence's blog

ad-hock vs greedy?
By 2ndSequence, history, 4 years ago, In English

Can anyone tell me briefly what's the difference between ad-hock and greedy problems?

probably wrong : but i know that there are two types of greedy.

  • One that can give you most optimal answer.

  • Second one which can give you a correct answer but not necessary optimal.

Now is ad-hock considered to be the same as second type? i just don't know.

Thanks in advance.

  • Vote: I like it
  • -17
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Its ad-hoc

→ Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

Ad-hoc is term that is supposed to mean not classifiable into a standard category that is thrown around on everything short impl now adays. Most of recent "ad-hoc" is rlly greedy or find formula. Ad-hoc can contain greedy or similar, but its overall idea is what matters when classifying, just as dp problem can contain a ds without the ds being the main idea, and vice versa.

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    can you please provide some good ad-hock questions to practice

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      I know that you didn't address me but if i were you i would solve problems with 800~1500R like 70% are just ad-hocks doesn't need certain algorithm or technique to solve them.

      and i may be wrong.

      → Reply