Béda révisi "Algoritma"

1 bita ditambahkeun ,  9 tahun yang lalu
taya kamandang éditan
m (r2.7.2) (bot Nambih: hy:Ալգորիթմ)
Tidak ada ringkasan suntingan
'''Algoritma''' nyaéta susunan paréntah, nu jumlahna kawates, pikeun ngolah sababaraha paréntah nu, sakumpulan data asupanana, bakal ngahasilkeun sarupaning bentuk ahir nu bisa dipikawanoh; sabalikna ti [[heuristik]]. Konsép algoritma mindeng digambarkeun ku conto hiji [[resép]], sanajan loba algoritma kacida ruwetna; algoritma sering miboga léngkah-léngkah anu malikan ([[iterasi]]) atawa merlukeun kaputusan (saperti [[logika Boolean|logika]] atawa [[kahenteusaruaan|perbandingan]]) nepi ka tugas diréngsékeunnana.
{{Tarjamahkeun|Inggris}}
Differentsababaraha algorithmsalogaritma maybisa completeanggeus theku samepagawean tasknu withsarua amake differentsusunan setparentah ofnu instructionsbeda in more or less time, space, or effort than others. For example, given two different recipes for making potato salad, one may have ''peel the potato'' before ''boil the potato'' while the other presents the steps in the reverse order, yet they both call for these steps to be repeated for all potatoes and end when the potato salad is ready to be eaten. <!-- poor example .. who would boil each potato separately? and making a salad in general requires no cooking ... -->
 
Correctly performing an algorithm will not solve a problem if the algorithm is flawed or not appropriate to the problem. For example, performing the potato salad algorithm will fail if there are no potatoes present, even if all the motions of preparing the salad are performed as if the potatoes were there.
Pamaké anonim