Data Structures

To sort many large object or structures, it would be most efficient to

A.	Place reference to them in and array an sort the array
B.	Place them in a linked list and sort the linked list
C.	Place pointers to them in an array and sort the array
D.	Place them in an array and sort the array
	Answer : B Explanation : Dynamic structure (Memory Allocated at run-time). We can have more than one datatype. Re-arrange of linked list is easy (Insertion-Deletion). It doesn’t waste memory. So, the answer is 'B' Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Suggest an improvement