author | berghofe |
Tue, 25 Jun 1996 13:11:29 +0200 | |
changeset 1824 | 44254696843a |
parent 1476 | 608483c2122a |
child 1896 | df4e40b9ff6d |
permissions | -rw-r--r-- |
(* Title: HOL/ex/insort.thy ID: $Id$ Author: Tobias Nipkow Copyright 1994 TU Muenchen Insertion sort *) InSort = Sorting + consts ins :: [['a,'a]=>bool, 'a, 'a list] => 'a list insort :: [['a,'a]=>bool, 'a list] => 'a list primrec ins List.list ins_Nil "ins f x [] = [x]" ins_Cons "ins f x (y#ys) = (if f x y then (x#y#ys) else y#(ins f x ys))" primrec insort List.list insort_Nil "insort f [] = []" insort_Cons "insort f (x#xs) = ins f x (insort f xs)" end