Thomas H. Cormen

Introduction to Algorithms yazarı
Yazar
9.2/10
6 Kişi
9
Okunma
3
Beğeni
991
Görüntülenme

Hakkında

Okurlar

3 okur beğendi.
9 okur okudu.
6 okur okuyor.
22 okur okuyacak.
4 okur yarım bıraktı.

Okur demografisi

Kadın% 0.0
Erkek% 0.0
0-12 Yaş
13-17 Yaş
18-24 Yaş
25-34 Yaş
35-44 Yaş
45-54 Yaş
55-64 Yaş
65+ Yaş
Reklam

Alıntılar

Tümünü Gör
An algorithm can be specified in English, as a computer program, or even as a hardware design. The only requirement is that the speciûcation must provide a precise description of the computational procedure to be followed.
An algorithm for a computational problem is correct if, for every problem instance provided as input, it halts - finishes its computing in finite time - and outputs the correct solution to the problem instance. A correct algorithm solves the given computational problem. An incorrect algorithm might not halt at all on some input instances, or it might halt with an incorrect answer. Contrary to what you might expect, incorrect algorithms can sometimes be useful, if you can control their error rate.
Reklam