English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

It means the question about the algorithm problem ?
eg: like to find the loop in the single link list in the order O(n) time .

2006-08-12 15:49:03 · 2 answers · asked by Anonymous in Computers & Internet Programming & Design

2 answers

don know
sorry

2006-08-12 16:44:37 · answer #1 · answered by Mikhil M 2 · 0 0

You can search for NP-hard or NP-complete problems on yahoo or check en.wikipedia.org /wiki/NP-hard for a list. The boolean satisfiability problem and halting problem are hard problems.

Loren Soth

2006-08-13 06:42:27 · answer #2 · answered by Lord Soth 3 · 0 0

fedest.com, questions and answers