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 | 5284 reads
|
Browse archives
Active forum topics |
Recent comments
17 weeks 3 days ago
17 weeks 3 days ago
17 weeks 3 days ago
23 weeks 3 days ago
1 year 11 weeks ago
1 year 11 weeks ago
1 year 11 weeks ago
1 year 33 weeks ago
1 year 38 weeks ago
1 year 39 weeks ago