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 | 4994 reads
|
Browse archivesActive forum topics |
Recent comments
1 week 5 days ago
1 week 5 days ago
1 week 5 days ago
23 weeks 6 days ago
28 weeks 1 day ago
29 weeks 5 days ago
29 weeks 5 days ago
32 weeks 3 days ago
37 weeks 21 hours ago
37 weeks 23 hours ago