Across
- 1. Slowest sorting procedure is-----
- 5. Sorting technique with divide and conquer approach-----
- 7. An algorithm used to organize data in specific order-----
- 9. Records to be sorted is small then-----sorting is efficient
- 10. Algorithm that finds position of value within sorted array-----
Down
- 2. Linear search is also called------
- 3. Sorting algorithm that build final sorted array one item at time-----
- 4. Finding required information from collection of items stored as elements in computer memory-----
- 6. Searching algorithm starts at beginning and check element sequentially-----
- 8. Common sorting algorithm known for efficiency-----