The Sorting Process Is Usually Reserved for a Relatively Large

Q1: In its simplest form,creating a(n)_ list involves

Q2: To correctly swap two values,you create a(n)_

Q3: Each element in a two-dimensional array requires

Q4: In a(n)_,if an element is out of

Q6: A record's _ field is the field

Q7: An insertion sort is another name for

Q8: When using a bubble sort to sort

Q9: When you _ records,you store a list

Q10: When you sort records,two possible approaches are

Q11: An array whose elements you can access