'B a y' diaporamas de présentation

Sorting lists: 1. Slow Sort

Sorting lists: 1. Slow Sort. inorder ( []). inorder ([_]). inorder ([A,B|T]) :- A < B, inorder ([B|T]). % slow_sort (L, S): Sorts list L, returning S. % Keep permuting L until it becomes sorted. slowsort (L, S) :- permutation(L, S), inorder (S). permutation([ ], [ ]).

208 views • 10 slides