Answer:
D.netiquette
hope it is helpful to you
Answer:
quicksort
Explanation:
There are many types of asymptotically efficient sorting algorithms that can be used but one of the more commonly used for large data lists would be quicksort. This is a sorting algorithm that focuses on choosing a value from the list and working around that value in order to sort the data piece by piece. For larger data sets this method is widely used due to its speed and efficiency which is exactly what Martha needs in this scenario.
Answer:
- def average_num_in_file(fileName):
- with open(fileName) as file:
- rows = file.readlines()
-
- sum = 0
- count = 0
- for x in rows:
- sum += float(x)
- count += 1
-
- average = sum / count
- return average
-
- print(average_num_in_file("cans.txt"))
Explanation:
The solution code is written in Python 3.
Firstly create a function that take one parameter, fileName (Line 1).
Open the file stream and use readlines method to read the data from the file (Line 2-3). Create variable sum and count to tract the total of the number from text files and number of data from the file (Line 5-6). Use a for loop to loop over each row of the read data and add the current value of each row to sum and increment the count by one (Line 7-9).
After the loop, calculate the average (Line 11) and return the result (Line 12).
At last, we can test the function by passing the cans.txt as argument (Line 14).
