1.When mergesort is implemented on a linked list it is possible to implement it as a stable sort. True or False?

These questions are based on shuffling linked lists:

2.Suppose the implementation of shuffling uses mergesort as the sorting algorithm, and it takes O(n^2) to generate n random numbers. Then shuffling can be implemented in ?

3.Suppose the implementation of shuffling uses bubblesort as the sorting algorithm, and it takes O(n) to generate n random numbers. Then shuffling can be implemented in?

4.Suppose the implementation of shuffling uses mergesort as the sorting algorithm, and it takes O(n) to generate n random numbers. Then shuffling can be implemented in?

5.The implementation of a shuffle on a linked list uses O(n) scratch space to store random numbers used for the shuffle.

 

Consult the resource on the Fisher-Yates shuffling algorithm to determine whether the following statement is true or false:

The Fisher-Yates algorithm can be implemented on a linked list so that it uses only O(1) scratch space with O(n) time complexity.

True or False?

SophiaPretty

(5)

Status NEW Posted 13 Dec 2017 06:12 AM My Price 7.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)

• Buy Answer