F:\homework\math\<span>fraction_hw.docx</span>
Answer:
Logic for a program
Explanation:
//Here ind = index
//declare the number
number ind
number sum
number avg
number SIZE = 20
number num[SIZE] = {0,0,0,0,0,0,0,0,0,0
,0,0,0,0,0,0,0,0,0,0}
getReady()
while ind < SIZE
getNumbers()
stop
getReady()
ind = 0
sum = 0
return
getNumbers()
cout<< “Enter a number for position ”, ind
input numbers[ind]
sum = sum + numbers[ind]
ind = ind + 1
return
;
finishUp()
avg = sum/SIZE
ind = 0
while ind < SIZE
output numbers[ind], avg – numbers[index]
ind = ind + 1
return
Modify the program in 2a
number index
number sum
number avg
number actualSize
number SIZE = 10
number number[SIZE] = 0
80% of the Pollution to the Marine Enviroment comes from Land.
Answer:
this is wot u get for not paying attiention on class
Explanation:
Answer:
The main benefit of the ordered list is that you can apply Binary Search( O( n log n) ) to search the elements. Instead of an unordered list, you need to go through the entire list to do the search( O(n) ).
The main cost of the ordered list is that every time you insert into a sorted list, you need to do comparisons to find where to place the element( O( n log n) ). But, every time you insert into an unsorted, you don't need to find where to place the element in the list ( O(1) ). Another cost for an ordered list is where you need to delete an element, you have an extra cost rearranging the list to maintain the order.
