Różnice między wybraną wersją a wersją aktualną.
| — |
pl:prolog:pllib:naiv_sort [2019/06/27 15:50] (aktualna) |
||
|---|---|---|---|
| Linia 1: | Linia 1: | ||
| + | ====== Naiv sort ====== | ||
| + | {{tag>soritng algorithms recursion}} | ||
| + | ===== Description ===== | ||
| + | Program implements naiv sort algorithm. | ||
| + | |||
| + | **Source**: Guide to Prolog Programming (on-line tutorial) | ||
| + | ===== Download ===== | ||
| + | Program source code: {{naiv_sort.pl}} | ||
| + | ===== Listing ===== | ||
| + | <code prolog> | ||
| + | naive_sort(List,Sorted):-perm(List,Sorted),is_sorted(Sorted). | ||
| + | |||
| + | is_sorted([]). | ||
| + | is_sorted([_]). | ||
| + | is_sorted([X,Y|T]):-X=<Y,is_sorted([Y|T]). | ||
| + | |||
| + | perm(List,[H|Perm]):-delete(H,List,Rest),perm(Rest,Perm). | ||
| + | perm([],[]). | ||
| + | |||
| + | delete(X,[X|T],T). | ||
| + | delete(X,[H|T],[H|NT]):-delete(X,T,NT).</code> | ||
| + | ===== Comments ===== | ||
