# Move Random into Base?

**URL:** <https://discourse.julialang.org/t/move-random-into-base/80669>\
**Category:** Internals & Design\
**Tags:** question, sort, base, random, stdlib\
**Created:** [May 7, 2022, 2:07pm UTC](https://discourse.julialang.org/t/move-random-into-base/80669 "2022-05-07T14:07:56Z")\
**Posts on this page:** 3\
**Page:** 2

<div class="post-metadata">

**Author:** ![Lilith](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/lilith/32/27492_2.png) [@Lilith](https://discourse.julialang.org/u/Lilith)\
**Post date:** [May 9, 2022, 2:04pm UTC](https://discourse.julialang.org/t/move-random-into-base/80669/21 "2022-05-09T14:04:40Z")

</div>

“Better algorithm” is a tricky thing to define

---

<div class="post-metadata">

**Author:** ![nsajko](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/nsajko/32/221187_2.png) [@nsajko](https://discourse.julialang.org/u/nsajko)\
**Post date:** [May 9, 2022, 2:22pm UTC](https://discourse.julialang.org/t/move-random-into-base/80669/22 "2022-05-09T14:22:49Z")

</div>

Agreed, but I think in the context of a standard library it’s clear that it’s preferable for a sorting algorithm of optimal asymptotic complexity in the worst case to be available, because the standard library needs to provide users with functionality that’s generally useful.  
As opposed with code optimized for special cases (“no adversarial input” is an example), which is less essential for a standard library to have.

---

<div class="post-metadata">

**Author:** ![Lilith](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/lilith/32/27492_2.png) [@Lilith](https://discourse.julialang.org/u/Lilith)\
**Post date:** [May 9, 2022, 7:51pm UTC](https://discourse.julialang.org/t/move-random-into-base/80669/23 "2022-05-09T19:51:01Z")

</div>

If this is a high priority for you, you’re always welcome to submit a pull request!

[Previous page](https://discourse.julialang.org/t/move-random-into-base/80669.md?page=1)