Algorithmic efficiency can be measured in terms of 1)time 2)space Time:How much amount of time it takes to complete the task space:How much space required to store the data of given task. A)To say a given number is even or odd---O(1) time is enough B)To check whether given number is present in the list or not ---O(n) here n means no of elements present in the list.We need to compare each element in the list with given number whether those two or equal or not C)To find smallest number in a list 2 cases:list with sorted elements---O(1) .just we return the first element of list list with unsorted elements O(n) because we have to traverse all the way in the list. D)O(n2)---because we are checking each element of list1 is present in the list2 or not.for that for each element we have to traverse whole list of list2. Here we are writing two loops.each iterate upto length of list E)O(n)---because elements are sorted.so,just we check the corresponding elements of list1 and list. Solution Algorithmic efficiency can be measured in terms of 1)time 2)space Time:How much amount of time it takes to complete the task space:How much space required to store the data of given task. A)To say a given number is even or odd---O(1) time is enough B)To check whether given number is present in the list or not ---O(n) here n means no of elements present in the list.We need to compare each element in the list with given number whether those two or equal or not C)To find smallest number in a list 2 cases:list with sorted elements---O(1) .just we return the first element of list list with unsorted elements O(n) because we have to traverse all the way in the list. D)O(n2)---because we are checking each element of list1 is present in the list2 or not.for that for each element we have to traverse whole list of list2. Here we are writing two loops.each iterate upto length of list E)O(n)---because elements are sorted.so,just we check the corresponding elements of list1 and list..

1. Algorithmic efficiency can be measured in terms of 1)time 2)space
Time:How much amount of time it takes to complete the task
space:How much space required to store the data of given task.
A)To say a given number is even or odd---O(1) time is enough
B)To check whether given number is present in the list or not ---O(n) here n means no of
elements present in the list.We need to compare each element in the list with given number
whether those two or equal or not
C)To find smallest number in a list
2 cases:list with sorted elements---O(1) .just we return the first element of list
list with unsorted elements O(n) because we have to traverse all the way in the
list.
D)O(n2)---because we are checking each element of list1 is present in the list2 or not.for that for
each element we have to traverse whole list of list2.
Here we are writing two loops.each iterate upto length of list
E)O(n)---because elements are sorted.so,just we check the corresponding elements of list1 and
list.
Solution
Algorithmic efficiency can be measured in terms of 1)time 2)space
Time:How much amount of time it takes to complete the task
space:How much space required to store the data of given task.
A)To say a given number is even or odd---O(1) time is enough
B)To check whether given number is present in the list or not ---O(n) here n means no of
elements present in the list.We need to compare each element in the list with given number
whether those two or equal or not
C)To find smallest number in a list
2 cases:list with sorted elements---O(1) .just we return the first element of list
list with unsorted elements O(n) because we have to traverse all the way in the
list.
D)O(n2)---because we are checking each element of list1 is present in the list2 or not.for that for
each element we have to traverse whole list of list2.
Here we are writing two loops.each iterate upto length of list
E)O(n)---because elements are sorted.so,just we check the corresponding elements of list1 and
list.