gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Minor grammatical corrections. (#31232)

Browse Source
This commit is contained in:
Himanshu27299
2019-01-15 06:59:33 +05:30
committed by Tom
parent 45d8907d00
commit 32e615055e
1 changed files with 2 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
guide/english/algorithms/sorting-algorithms/bucket-sort/index.md
View File

@ -3,9 +3,9 @@ title: Bucket Sort
--- ---
## What is Bucket Sort ? ## What is Bucket Sort ?
Bucket sort is a comparison sort algorithm that operates on elements by dividing them into different buckets and then sorting these buckets Bucket Sort is a comparison sort algorithm that operates on elements by dividing them into different buckets and then sorting these buckets
individually. Each bucket is sorted individually using a separate sorting algorithm or by applying the bucket sort algorithm recursively. individually. Each bucket is sorted individually using a separate sorting algorithm or by applying the bucket sort algorithm recursively.
Bucket sort is mainly useful when the input is uniformly distributed over a range. Bucket Sort is mainly useful when the input is uniformly distributed over a range.
## Assume one has the following problem in front of them: ## Assume one has the following problem in front of them:
One has been given a large array of floating point integers lying uniformly between the lower and upper bound. This array now needs to be One has been given a large array of floating point integers lying uniformly between the lower and upper bound. This array now needs to be
@ -28,17 +28,13 @@ void bucketSort(float[] a,int n)
for(each floating integer 'x' in n) for(each floating integer 'x' in n)
{ {
insert x into bucket[n*x]; insert x into bucket[n*x];
} }
for(each bucket) for(each bucket)
{ {
sort(bucket); sort(bucket);
} }
} }