Answer:
- def getLargest(number_list):
- new_list = []
-
- for x in number_list:
- if(isinstance(x, int)):
- new_list.append(x)
-
- largest = max(new_list)
-
- return largest
Explanation:
Firstly, create a function <em>getLargest()</em> that take one input parameter, <em>number_list</em>.
The function will filter out the float type number from the list by using <em>isinstance() </em>method (Line 5). This method will check if a current x value is an integer. If so, the x value will be added to <em>new_list</em>.
Next, use Python built-in <em>max</em> function to get the largest integer from the <em>new_list </em>and return it as output.
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:
<h2>NO</h2>
Explanation:
<h2>because Technology does not always follow science but it may actually lead science in some instances. An example is weather forecasting.</h2><h2>Mark me brainliest plz</h2>
Answer:
E. 7.0
Explanation:
the 7 of the out of the older and make a shame of waves and force of trying