1.12 - sorting and searching

1234567891011121314
Across
  1. 4. What type of search involves starting at the beginning and looking through the list until you find what you are looking for? (6)
  2. 5. Putting data into a certain order. (7)
  3. 6. Looking through data to find a certain thing. (9)
  4. 9. One disadvantage of binary search is the the list must be put into _____ first. (5)
  5. 10. For large numbers of items the bubble sort tends to be much ______ than merge sort. (6)
  6. 12. The method by which merge sort works. It begins with the letter r! (9)
  7. 13. A sorting algorithm that compares adjacent items and swaps them over as needed until everything is in the correct order. (6,4)
Down
  1. 1. An algorithm for a sorting algorithm can be shown in this type of diagram. (9)
  2. 2. A sorting _________ is a widely used procedure for putting some data into order. (9)
  3. 3. A complete traversal of a list during a bubble sort is called a ____. (4)
  4. 7. A sorting algorithm that splits a list up into parts and recursively sorts the parts and then joins them back together. (5,4)
  5. 8. Bubble sort is ______ to write than merge sort. (6)
  6. 11. What type of search involves finding the middle and looking to see if the item is on one side or the other? (6)
  7. 14. Linear search is sometimes called a _____ force algorithm. (5)