1. Write a program that sorts an array of 15 numbers using both the bubble sort and selection sort algorithms, and keep counts of the number of swaps it makes in both cases. The program should display both the counts.
2. Write a program that searches for a key value in an ordered array of 15 numbers using both the linear and binary search algorithms, and keep counts of the number of comparisons it makes in both cases.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here