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

Use direct BE link but keep archived option #116

Merged
merged 2 commits into from
Sep 16, 2024
Merged

Use direct BE link but keep archived option #116

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
93a8592
Use direct BE link but keep archived option
kaBeech Sep 16, 2024
69d6dda
Remove extra whitespace
kaBeech Sep 16, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 7 additions & 8 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ This project started as an exploration of what a sorting algorithm that
prioritizes robustness might look like. As such it also describes and provides
implementations of Robustsort, a group of Tensort variants designed for
robustness in conditions described in David H. Ackley's
[Beyond Efficiency](https://web.archive.org/web/20240809143400/https://www.cs.unm.edu/~ackley/be-201301131528.pdf).
[Beyond Efficiency](https://www.cs.unm.edu/~ackley/be-201301131528.pdf).

Simply put, Tensort takes an input list, transforms the list into a
multi-dimensional tensor field, then transforms that tensor field back into a
Expand Down Expand Up @@ -75,8 +75,9 @@ we wish to do on the elements.

### Inspiration

- [Beyond Efficiency](https://web.archive.org/web/20240809143400/https://www.cs.unm.edu/~ackley/be-201301131528.pdf) by
[David H. Ackley](https://livingcomputation.com/)
- [Beyond Efficiency](https://www.cs.unm.edu/~ackley/be-201301131528.pdf)
([archived](https://web.archive.org/web/20240809143400/https://www.cs.unm.edu/~ackley/be-201301131528.pdf))
by [David H. Ackley](https://livingcomputation.com/)

- [Beyond Efficiency by Dave Ackley](https://futureofcoding.org/episodes/070)
by Future of Coding ([Lu Wilson](https://www.todepond.com/),
Expand Down Expand Up @@ -201,7 +202,7 @@ Bubblesort and Mergesort, and
Quicksort.

It also assumes you've read
[Beyond Efficiency](https://web.archive.org/web/20240809143400/https://www.cs.unm.edu/~ackley/be-201301131528.pdf) by
[Beyond Efficiency](https://www.cs.unm.edu/~ackley/be-201301131528.pdf) by
David H. Ackley. Go read it! It's short!

Please note that we will discuss a few algorithms that I've either made up or
Expand All @@ -224,9 +225,7 @@ Magicsort.
notable example of a robust sorting algotithm is Ackley's
<a href="https://www.youtube.com/watch?v=helScS3coAE&t=260s"
rel="noopener noreferrer"
target="_blank">
Demon Horde Sort
</a>,
target="_blank">Demon Horde Sort</a>,
which I purposefully avoiding learning much about before publishing v1.0.0.0
of this package. Demon Horde Sort is more truly robust than Tensort, being
resiliant against far more types of unexpected conditions than just a wonky
Expand All @@ -240,7 +239,7 @@ Magicsort.
I will also be joined by the spirit of Sir Michael Caine, who is here for two
reasons. One is to keep an eye on me and make sure I don't go too overboard.
More importantly, he's here as a bit of insurance to make sure you've read
[Beyond Efficiency](https://web.archive.org/web/20240809143400/https://www.cs.unm.edu/~ackley/be-201301131528.pdf). You
[Beyond Efficiency](https://www.cs.unm.edu/~ackley/be-201301131528.pdf). You
can think of him as my version of the M&M's on Van Halen's concert
rider ([the most famously robust rider in rock
history](https://en.wikipedia.org/wiki/Van_Halen#Contract_riders)). If you
Expand Down
Loading