__________is combining the records in two different sorted files in to a single sorted file.

Related Questions

• An array that is first 7-sorted, then 5-sorted becomes
• Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?
• The efficient searching algorithm for algorithm for a sorted array is _________.
• Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if
• In _______________all the records contain the same data items with the same amount of space.
• The possibility of two different keys k1 & k2 yielding the same hash address is called__________.
• The hashing file space is divided into_______________.
• A ___________refers to a single unit of values.
• Graph traversal is different from a tree traversal, because
• In linked list each node contain minimum of two fields. One field is data field to store the data second field is?