User loginNavigation |
The 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 | previous forum topic | next forum topic | other blogs | 5165 reads
|
Browse archives
Active forum topics |
Recent comments
2 weeks 6 days ago
43 weeks 21 hours ago
43 weeks 1 day ago
43 weeks 1 day ago
1 year 13 weeks ago
1 year 17 weeks ago
1 year 19 weeks ago
1 year 19 weeks ago
1 year 21 weeks ago
1 year 26 weeks ago