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 | 5385 reads
|
Browse archives
Active forum topics |
Recent comments
2 hours 42 min ago
22 hours 12 min ago
12 weeks 1 day ago
12 weeks 2 days ago
12 weeks 3 days ago
12 weeks 3 days ago
13 weeks 1 day ago
13 weeks 1 day ago
13 weeks 1 day ago
16 weeks 2 days ago