1. If an array is sorted in this order, the values are stored from highest to lowest. a. asymptotic b. logarithmic c. ascending d. descending 2. This algorithm makes several passes through an array...

1. If an array is sorted in this order, the values are stored from highest to lowest. a. asymptotic b. logarithmic c. ascending d. descending

2. This algorithm makes several passes through an array and causes the larger values to gradually move toward the end of the array with each pass. a. bubble sort b. selection sort c. insertion sort d. sequential sort