# Bucket Sort

[**\[알고리즘\] 버킷 정렬 (Bucket Sort)**](https://hroad.tistory.com/25)

> `계수 정렬은 키 값이 작은 범위` 안에 들어올 때 적용할 수 있는 방법이지만 `버킷 정렬`은 키 값의 `범위`뿐만이 아니라 그 범위 내에서 키값이 확률적으로 `균등하게 분포`된다고 가정할 수 있을 때 적용할 수 있는 방법이다.

### Bucket sort

* Bucket sort is mainly useful when input is uniformly distributed over a range


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://algorithm.prettylog.com/overview/readme/counting-sort/bucket-sort.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.