Sorting: Ep 06 - Bucket Sort

In this episode we take a look at the sorting algorithm that isn't really a sorting algorithm!

Category:

Education

Tags:

• sort
• sorting
• computer
• algorithm
• bucket
• insertion

[subhadeep9874]

Cool way of presentation :)

[lcc0612]

@subhadeep9874

Cheers! Glad it worked for you!

[konsu89]

FAST - explain a little slower - but over all really nice video!

[lcc0612]

@konsu89

Hello, thanks for your comment! I've already taken note of this and (hopefully!) taken this into consideration for future videos. Glad I've been a help =)

[chesterr400]

What kind of Desktop Recorder are you using?

Thank you :))

and your tutorials are great! :P

[lcc0612]

@chesterr400

Hello! Thanks for your comment. I use CamStudio for desktop recording.

[fopax]

great video, but no have spanish subtitles :(

[LAJAVOPSETO]

@alejandrosoto27

The Pseudocode for bucket sort is

n <-- length[ A ]

for i <-- 1 to n

do insert A[ i ] into the list B [ nA[ i ] ]

for i <-- 0 to n-1

do sort the list B[ i ] with insertion sort

merge neatly the lists B[ 1 ], B[ 2 ], . . , B[ n-1 ]

hope it will help! :)

[impatrick4]

@lcc0612

I see, I didn't notice it. Well, hey my bad. Anyway, we are doing a report about this sort, well, i was wondering if you could send me an email regarding this and a more elaborated explanation if that's possible.

Thank you.

[lcc0612]

@impatrick4

Hello! You have a valid point there. You need to somehow know the full range of your data before you can carry out a bucket sort.

I quote an earlier post by myself...

"While I'm not sure if there are more efficient methods, you could, of course, make one pass across all the input values, and determine the maximum and minimum values, to give yourself a range for creating buckets."