1. |
Modify the selection sort algorithm to sort an array of strings. Answer: |

2. |
Modify the merge sort algorithm to sort an array of strings. Answer: |

3. |
Implement the bubble sort algorithm. Answer: |

4. |
Implement a sort not covered in the book. Either invent your own sort or find information on new sorts such as the insertion sort, shell sort, tree sort, or heap sort. Answer: |

5. |
Answer: |

6. |
Answer: |

7. |
Write a program to read, save, and sort memos. Answer: |

8. |
Write a sort simulation program. Allow a user to choose the length of an array of integers. The user then chooses the contents of the array. The array can contain random integers, sorted integers, or integers in descending order, from highest value to lowest value. Run and time the selection sort, merge sort, and quicksort (use Java's Arrays.sort() method for quicksort) on the array. Output to a text area to allow the user to run multiple simulations and scroll through the results. Output should be similar to the following: Answer: |

9. |
What is the big-Oh formula for the selection sort? Answer: |

10. |
Given the equation for big-Oh notation: Answer: |

11. |
Suppose algorithm Answer: |

12. |
Below is a table giving the timings of algorithm
Answer: |

13. |
Modify your existing program or create a new program to read, save, sort, and search memos. Answer: |

14. |
Given a city name, find the state the city is in. Implement a City object that contains a city's name and state. For convenience, allow the program to read in cities from a file. Allow the user to enter a city name. If the city is in your list, output the state the city is in, otherwise indicate that the information is not available. Answer: |

15. |
If you search an array only once, it is more efficient to pay for an O( Answer: |