Name of this sorting algorithm?

Question

You have a shuffled set of cards. You have to re-order them.

You do this by assigning each card a number based on its value (jack = 11, queen - 12) etc and its suite (hearts = 0, clubs = 1 ...). Each card gets unique number by formula (14 * suite) + value. You then have an empty array of 52 elements and just put each card in its correct position. This is very fast - big o would be O(N). What is the name for this approach?

SomeWittyUsername · Accepted Answer · 2013-03-28 09:41:58Z

7

It's called Counting Sort. You gain speed on expense of space.

edited Mar 28, 2013 at 9:41

answered Mar 28, 2013 at 9:33

SomeWittyUsername

18.4k3 gold badges46 silver badges87 bronze badges

Sign up to request clarification or add additional context in comments.

7 Comments

Anton Over a year ago

Is it bucket sort ? Is it counting sort or something like this, OP simply puts elements to right position without comparing elements with each other.

SomeWittyUsername Over a year ago

@Anton You're totally right, thanks! My only excuse is that it's same family and counting sort is actually a trivial version of bucket sort...

Randy Howard Over a year ago

Somewhat amusing how many upvotes this got while being wrong. :-)

SomeWittyUsername Over a year ago

@RandyHoward well, it wasn't completely wrong, see my previous comment :)

Randy Howard Over a year ago

Yeah, it's probably splitting hairs at this point, unless it's for a homework assignment where he needs to be specific.

|

AxxG · Accepted Answer · 2013-03-28 09:41:32Z

0

I think, there is no special name for it. It is a kind of insertion sort with unique identification of objects.

Here is an overview

answered Mar 28, 2013 at 9:41

AxxG

2043 silver badges11 bronze badges

Collectives™ on Stack Overflow

Name of this sorting algorithm?

2 Answers 2

7 Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

7 Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related