(b)Write down the algorithms for the insertion and deletion functions in DLlist.Assume that you want to insert a new node to the right of anode and delete anode named dnode for a nonempty list. (15%)

6. A simplest known sorting method called “counting sort” is described as follows.Declare an array count and set count[k] to the number of key values that are lessthan k. Therefore, the record with key k can be placed in position count[k] of anoutput list. (You should beware of the possibility of equal key values. See anexample in Figure 1.) Assume that all keys of the records are integers and theirvalues are in range of [0, d], where d is a constant. Write an algorithm to sort a setof records with size n by the key value using this method (including how todetermine the count[k]). (15%)

題組內容

(b)Write down the algorithms for the insertion and deletion functions in DLlist.
Assume that you want to insert a new node to the right of anode and delete a
node named dnode for a nonempty list. (15%)

相關申論題

相關試卷