User loginNavigation |
archivesThe verified insertion sort algorithmThe following article describes a verified version of the insertion sort algorithm. The insertion sort is one of the simplest sorting algorithms and efficient for small data sets. In the article it is shown how ghost functions/predicates can be used to keep the loop invariant expressive and readable. By hbrandl at 2012-07-01 20:53 | LtU Forum | login or register to post comments | other blogs | 5032 reads
|
Browse archivesActive forum topics |
Recent comments
15 weeks 1 day ago
15 weeks 1 day ago
15 weeks 1 day ago
37 weeks 3 days ago
41 weeks 4 days ago
43 weeks 2 days ago
43 weeks 2 days ago
46 weeks 22 min ago
50 weeks 4 days ago
50 weeks 4 days ago