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

Questions by Rujul   answers by Rujul

Showing Answers 1 - 14 of 14 Answers

azrael

  • Apr 26th, 2007
 

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

  Was this answer useful?  Yes

Rashi Rathi

  • Nov 14th, 2007
 

 insertion sort...

  Was this answer useful?  Yes

manishmodgil

  • Dec 28th, 2007
 

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 :-)

  Was this answer useful?  Yes

snyder

  • Mar 10th, 2012
 

Please refer to http://courses.cs.vt.edu/csonline/Algorithms/Lessons/SortingAlgorithms/index.html

it will really help

  Was this answer useful?  Yes

Malang jan afridi

  • Sep 4th, 2014
 

Dear All,
Insertion sort

  Was this answer useful?  Yes

Rohith

  • Mar 1st, 2016
 

Insertion sort

  Was this answer useful?  Yes

arvind

  • Oct 19th, 2016
 

3. insertion sort

  Was this answer useful?  Yes

Dinesh Chenani

  • May 9th, 2017
 

insertion sort

  Was this answer useful?  Yes

jenny

  • May 9th, 2017
 

selection sort

  Was this answer useful?  Yes

The way a card game player arranges his cards as h

  • Aug 16th, 2017
 

3. insertion sort

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions