Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Sorting: Exercise 2.1 #14

Open
ablearthy opened this issue Feb 1, 2024 · 0 comments
Open

Sorting: Exercise 2.1 #14

ablearthy opened this issue Feb 1, 2024 · 0 comments

Comments

@ablearthy
Copy link
Contributor

In 2024 edition there's no exercise 2.1:

Exercise 2.1. Show that any sorting function has the same input/output behaviour as insertion sort:
(∀ xs: mset (f xs) = mset xs) ∧ (∀ xs: sorted (f xs)) → f xs = isort xs.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ablearthy