seven languages in seven weeks prolog day 2

my_sort.pl

my_sort(List, Result) :-
    my_sort(List, [], Result).

my_sort([], SortedList,SortedList).

my_sort([Head|Tail], SortedList, Result) :-
    insert(Head, SortedList, SubResult),
    my_sort(Tail, SubResult, Result).

insert(ElementToInsert, [], [ElementToInsert]).


insert(ElementToInsert, [FirstElement|Rest], [FirstElement | SubResult]) :-
    ElementToInsert > FirstElement,
    insert(ElementToInsert, Rest, SubResult ).

insert(ElementToInsert, SortedList, [ElementToInsert | SortedList]) :-
    [FirstElement|_] = SortedList,
    ElementToInsert =< FirstElement.

reverse.pl

reverse_list([], []).
reverse_list([Head|Tail], [ResultForTail|Head])
    :- reverse_list(Tail, ResultForTail).

smallest.pl

smallest([X],X).
smallest([A,B|Rest],Minimum) :- (A < B), smallest([A|Rest],Minimum).
smallest([A,B|Rest],Minimum) :- (B =< A), smallest([B|Rest],Minimum).

smallest_2.pl

min(Number1, Number2, Number1) :- Number1 =< Number2.
min(Number1, Number2, Number2) :- Number1 > Number2.

smallest([Head|Tail], Min) :-
    smallest(Tail, Head, Min).

smallest([], Min, Min).
smallest([Head|Tail], Min0, Min) :-
    min(Head, Min0, Min1),
    smallest(Tail, Min1, Min).

smallest_final.pl

min(A, B, A) :- A =< B, !.
min(A, B, B) :- A > B, !.
 
smallest([A],A) :- !.
smallest([A, B |Rest],Minimum) :- smallest([A |Rest], MinRest), min(B, MinRest, Minimum).