Scoala :: Din seria "ca vitzelu la poarta noua"

Imi pare rau daca va "poluez" cu mate, dar trebuie sa impartasesc cu voi o parte a temei mele pentru o materie numita "Principiile IA" dar care cred ca va fi "Teoria detaliata si aprofundata a incertitudinii". Citatul din tema mie mi se pare foarte haios (daca nu ma gandesc la faptul ca face parte din tema).
Nota : omu e chinez si are niste mici probleme de exprimare, dar cred ca in mare se intelege.

"Bogo-sort is the archetypical perversely awful algorithm (as opposed to bubble-sort, which is merely the generic bad algorithm). Bogo-sort is equivalent to repeatedly throwing a deck of cards in the air, picking them up at random, and then testing whether they are in order. It serves as a sort of canonical example of awfulness [ca sa nu zica altfel ..]. Looking at a program and seeing a dumb algorithm, one might say "Oh, I see, this program uses bogo-sort". Especially appropriate for algorithms with factorial or super-exponential running time in the average case and probabilistically infinite worse-case running time.Compare bogo-sort to brute force." Bla, bla, bla.

Ideea e, pan la urma, ca algoritmii aleatori dau rezultate bune in multa aplicatii din "lumea reala". Totusi asta nu mi se pare o motivatie suficienta sa fac o tema imensa cu exercitii cu probabilitati..