trace route of the quicksort algorithm - prolog
问题 I have that previous question about this quicksort here.The prolog code for quicksort: gt(X,Y):- X @>Y. conc([],List, List). conc([Head|Tail], List1, [Head|List2]):- conc(Tail, List1, List2). quicksort([],[]). quicksort([X|Tail],Sorted):- split(X,Tail,Small,Big), quicksort(Small,SortedSmall), quicksort(Big,SortedBig), conc(SortedSmall,[X|SortedBig],Sorted). [1]split(X,[],[],[]). [2]split(X,[Y|Tail],[Y|Small],Big):- gt(X,Y),!, split(X,Tail,Small,Big). [3]split(X,[Y|Tail],Small,[Y|Big]):- split