The bubble sort makes multiple passes through a list. It compares adjacent items and exchanges those that are out of order. Each pass through the list places the next largest value in its proper place. In essence, each item “bubbles” up to the location where it belongs.
Answer:
No clue!
can I get brainliest tho-
3 would be self management
Answer:
The time complexity of the code is O(log₇n).
Explanation:
The i is updated by 7*i.On each iteration i is multiplied by 7.So on finding the time complexity of the code given above it will come out to be log base 7.
When we divide the input by 2 the time complexity is log base 2.
So on dividing it by 7 we get the time complexity of log base 7.
Answer:
- import statistics
- def st_dev(file_name):
- with open(file_name) as file:
- data = file.readlines()
- numList = []
- for x in data:
- numList.append(int(x))
-
- return statistics.pstdev(numList)
- print(st_dev("text1.txt"))
Explanation:
The solution code is written using Python.
To ease the calculation task, we can import Python statistics module to use the pstdev method to calculate the population standard deviation of a list of numbers (Line 1).
Next, create a st_dev function that take single argument file_name (Line 3). In the function, it will open the input file and read the data line by line (Line 4-5). Create a for loop to traverse through each line of the data which is an integer and append it to numList (Line 7-8). We can pass the numList to pstdev method (Line 10) and return the resulting standard deviation value as output.
We test the function by passing a file which hold a list of integer values in each line (Line 12).
8
9
12
11
21
15
16
10
7
13
And the output we shall get is 4.019950248448356
