# Little Help implementing Quick-sort algorithm

**URL:** <https://forum.elixirforum.com/t/little-help-implementing-quick-sort-algorithm/22784>\
**Category:** Questions\
**Tags:** algorithm\
**Created:** [May 30, 2019, 9:08am UTC](https://forum.elixirforum.com/t/little-help-implementing-quick-sort-algorithm/22784 "2019-05-30T09:08:47Z")\
**Posts on this page:** 1\
**Showing post:** 5

<div class="post-metadata">

**Author:** ![NobbZ](https://forum.elixirforum.com/user_avatar/forum.elixirforum.com/nobbz/32/27235_2.png) [@NobbZ](https://forum.elixirforum.com/u/NobbZ)\
**Post date:** [May 30, 2019, 12:19pm UTC](https://forum.elixirforum.com/t/little-help-implementing-quick-sort-algorithm/22784/5 "2019-05-30T12:19:48Z")

</div>

Not the `lesser_than_head` is usually called `pivot`, but the `head` is. Its the pivot point you use to compare.

Also you are still not sorting the `greater_than_head` 😉

---

_[View the full topic](https://forum.elixirforum.com/t/little-help-implementing-quick-sort-algorithm/22784)._