feat: query complexity model for algorithms theory - #372
Conversation
e54ec5f to
8be8d07
Compare
chenson2018
left a comment
There was a problem hiding this comment.
This looks in much better shape now, just some relatively minor things from me:
@chenson2018 : I think I have addressed all your review comments so far. |
chenson2018
left a comment
There was a problem hiding this comment.
I pushed one small golf, and my other comments have been addressed. I left the two comments where I'd tagged @eric-wieser unresolved so they can be double checked. As usual, leaving for @fmontesi for final consideration.
Co-authored-by: Eric Wieser <wieser.eric@gmail.com>
…o query-final-squash
| # Query Type for Comparison Search in Lists | ||
|
|
||
| In this file we define two query types `SortOps` which is suitable for insertion sort, and | ||
| `SortOps`for comparison based searching in Lists. We define a model `sortModel` for `SortOps` |
There was a problem hiding this comment.
Nit: Is one of the SortOps supposed to be different, or are they supposed to be duplicated?
There was a problem hiding this comment.
We changed the name to the shorter SortOps since we would like that to be the default comparison sort model
…o query-final-squash
Co-authored-by: Ethan Ermovick <61568556+Arleee1@users.noreply.github.com>
This merge preserves the commit history of leanprover#372 — Shreyas' earlier work on the query complexity model — in the ancestry of this branch. The tree is taken from upstream/main: the superseding implementation lands in the commits that follow.
This is a highly squashed version of #275 with a smaller commit an comment history for ease of further reviewing.
Authors: Shreyas Srinivas, Tanner Duve, Eric Wieser.