Блог пользователя 2ndSequence

ad-hock vs greedy?
Автор 2ndSequence, история, 6 лет назад, По-английски

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.

  • Проголосовать: нравится
  • -17
  • Проголосовать: не нравится

»
6 лет назад, скрыть # |
 
Проголосовать: нравится +2 Проголосовать: не нравится

Its ad-hoc

→ Ответить
»
6 лет назад, скрыть # |
← Rev. 2  
Проголосовать: нравится +1 Проголосовать: не нравится

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.

→ Ответить