Data Structures - the way a card game player arranges his cards as he picks them up one by one, is an example of

GeekInterview.com > Interview Questions > Concepts > Data Structures

Go To First | Previous Question | Next Question

Data Structures | Question 170 of 202

the way a card game player arranges his cards as he picks them up one by one, is an example of

1. bubble sort 2. selection sort
3. insertion sort 4. merge sort

Total Answers and Comments: 5

Last Update: May 25, 2008 Asked by: Rujul

Sponsored Links

Best Rated Answer

—

Submitted by: aries

Insertion Sort

Above answer was rated as good by the following members:
chubby

April 26, 2007 10:37:22

azrael

RE: the way a card game player arranges his cards as ...

None it's an key sorting algorithm with a 52 cards key ;).

Is this answer useful? Yes | No

August 29, 2007 19:46:38

aries

RE: the way a card game player arranges his cards as ...

Insertion Sort

Is this answer useful? Yes | No

1 0

Overall Rating: +1

November 14, 2007 14:13:22

Rashi Rathi

RE: the way a card game player arranges his cards as ...

insertion sort...

Is this answer useful? Yes | No

December 28, 2007 01:27:24

manishmodgil

Member Since: July 2006 Contribution: 15

RE: the way a card game player arranges his cards as he picks them up one by one, is an example of 1. bubble sort 2. selection sort 3. insertion sort 4. merge sort

He scans throught the rest of the cards and pick the one with least value and places it next to the point till which he has already sorted the cards

Insertion Sort :-)

Is this answer useful? Yes | No

May 25, 2008 03:45:56

sharmivr86

Member Since: May 2008 Contribution: 1

RE: the way a card game player arranges his cards as he picks them up one by one, is an example of 1. bubble sort 2. selection sort 3. insertion sort 4. merge sort

it is an example of insertion sort

Is this answer useful? Yes | No

Go To Top

User Name		Remember Me?
Password

Question Bank