# Sorting images

**URL:** <https://forum.snap.berkeley.edu/t/sorting-images/17233>\
**Category:** Computer Science\
**Tags:** image, sorting\
**Created:** [July 28, 2024, 8:17am UTC](https://forum.snap.berkeley.edu/t/sorting-images/17233 "2024-07-28T08:17:56Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![mehone](https://forum.snap.berkeley.edu/letter_avatar_proxy/v4/letter/m/6f9a4e/32.png) [@mehone](https://forum.snap.berkeley.edu/u/mehone)\
**Post date:** [July 28, 2024, 8:17am UTC](https://forum.snap.berkeley.edu/t/sorting-images/17233/1 "2024-07-28T08:17:56Z")

</div>

i watched a video a long time ago about sorting images, i didnt watch all of it but in theory

we could make it possible by constantly checking if its equal to the correct image, if not, we do it again, this only works with bogosort, other sorts are too hard to create as im still a beginner

:alonzo: alonzo my beloved :alonzo:

---

<div class="post-metadata">

**Author:** ![me\_the\_super](https://forum.snap.berkeley.edu/user_avatar/forum.snap.berkeley.edu/me_the_super/32/27920_2.png) [@me\_the\_super](https://forum.snap.berkeley.edu/u/me_the_super)\
**Post date:** [July 29, 2024, 4:57pm UTC](https://forum.snap.berkeley.edu/t/sorting-images/17233/2 "2024-07-29T16:57:52Z")

</div>

Isn't bogosort meant to be extremely slow? Not only is it also known as "stupid sort" but it isn't meant to be useful for sorting.

> **[Bogosort](https://en.wikipedia.org/wiki/Bogosort)**
>
> In computer science, bogosort (also known as permutation sort and stupid sort) is a sorting algorithm based on the generate and test paradigm. The function successively generates permutations of its input until it finds one that is sorted. It is not considered useful for sorting, but may be used for educational purposes, to contrast it with more efficient algorithms. The algorithm's name is a portmanteau of the words bogus and sort.
> Two versions of this algorithm exist: a deterministic version...