:{foster, enthusiasm, wagon, ally, lehigh, programming, dog, cat, Ally, smile, pet }; a. Suppose you perform...

 

Transcribed Image Text:

:{"foster", "enthusiasm", "wagon", "ally", "lehigh", "programming", "dog", "cat", "Ally", "smile", "pet" }; a. Suppose you perform insertion sort in order to sort A in ascending order. How many comparisons are performed when sorting A? How many swaps are performed when sorting A? b. Suppose you perform a binary search on the sorted array A above (in ascending order). Recall that Java truncates any decimals when performing integer division. How many comparisons are performed when searching for the keys below? i. Searching for "pronoun" i. Searching for "dog" 2. Let B be an array of integers, where B = {359, -96, 5, 18,32, -48, -3, 61, 1, -23, 48, -27, 48, -32, 100}; c. Suppose that you perform a linear search on unsorted array B. How many comparisons are performed when searching for the keys below? i. Searching for 0 ii. Searching for -32 b. Suppose that you sort B in descending order using an selection sort algorithm. How many comparisons are performed when sorting B? How many swaps are performed when sorting B? :{"foster", "enthusiasm", "wagon", "ally", "lehigh", "programming", "dog", "cat", "Ally", "smile", "pet" }; a. Suppose you perform insertion sort in order to sort A in ascending order. How many comparisons are performed when sorting A? How many swaps are performed when sorting A? b. Suppose you perform a binary search on the sorted array A above (in ascending order). Recall that Java truncates any decimals when performing integer division. How many comparisons are performed when searching for the keys below? i. Searching for "pronoun" i. Searching for "dog" 2. Let B be an array of integers, where B = {359, -96, 5, 18,32, -48, -3, 61, 1, -23, 48, -27, 48, -32, 100}; c. Suppose that you perform a linear search on unsorted array B. How many comparisons are performed when searching for the keys below? i. Searching for 0 ii. Searching for -32 b. Suppose that you sort B in descending order using an selection sort algorithm. How many comparisons are performed when sorting B? How many swaps are performed when sorting B?

Answer rating: 100% (QA)

Given Array A foster enthusiasm wagon ally lehigh programming dog cat Ally smile pet index 1 val enthusiasm Number of comparisons 1 Number of swaps 1 ... View the full answer