you have to be extremely talented to be a software engineer so I see that as way more complex and cool.
Answer:
See explaination for the program code
Explanation:
The code below
Pseudo-code:
//each item ai is used at most once
isSubsetSum(A[],n,t)//takes array of items of size n, and sum t
{
boolean subset[n+1][t+1];//creating a boolean mtraix
for i=1 to n+1
subset[i][1] = true; //initially setting all first column values as true
for i = 2 to t+1
subset[1][i] = false; //initialy setting all first row values as false
for i=2 to n
{
for j=2 to t
{
if(j<A[i-1])
subset[i][j] = subset[i-1][j];
if (j >= A[i-1])
subset[i][j] = subset[i-1][j] ||
subset[i - 1][j-set[i-1]];
}
}
//returns true if there is a subset with given sum t
//other wise returns false
return subset[n][t];
}
Recurrence relation:
T(n) =T(n-1)+ t//here t is runtime of inner loop, and innner loop will run n times
T(1)=1
solving recurrence:
T(n)=T(n-1)+t
T(n)=T(n-2)+t+t
T(n)=T(n-2)+2t
T(n)=T(n-3)+3t
,,
,
T(n)=T(n-n-1)+(n-1)t
T(n)=T(1)+(n-1)t
T(n)=1+(n-1)t = O(nt)
//so complexity is :O(nt)//where n is number of element, t is given sum
Answer:
Following is the program in Python language
def uniquely_sorted(lst1): #define the function uniquely_sorted
uni_que = [] #creating an array
for number in lst1: #itereating the loop
if number not in uni_que: #check the condition
uni_que.append(number)#calling the function
uni_que.sort() #calling the predefined function sort
return uni_que #returns the unique values in sorted order.
print(uniquely_sorted()([8, 6, 90, 76])) #calling the function uniquely_sorted()
Output:
[6,8,76,90]
Explanation:
Following are the description of the Python program
- Create a functionuniquely_sorted() that takes "lst1" as a list parameter.
- Declared a uni_que[] array .
- Iterating the loop and transfer the value of "lst1" into "number"
- Inside the loop call, the append function .the append function is used for adding the element in the last position of the list.
- Call the predefined function sort(for sorting).
- Finally, call the function uniquely_sorted() inside the print function.
what is the meaning to this??
Answer:
The output of code will be 10
Explanation:
We need to find output of following code:
C = 1
Sum = 0
while (c less than 10):
C = c + 3
sum = sum + c
print (sum)
Solution:
We will check the condition of while loop, if the condition is true, then the statements inside the loop will be executed. Since brackets are not available so, only one statement is linked with while loop.
First while loop will be executed c < 10 (1<10) the condition becomes true, and statement c=c+3 will be executed ( 4=1+3) and then loop condition will be checked (4<10) the condition becomes true, and statement c=c+3 will be executed ( 7=4+3) and then loop condition will be checked (7<10) the condition becomes true and statement c=c+3 will be executed ( 10=7+3) and then loop condition will be checked (10<10) the condition becomes false, so we will come outside loop body and execute: sum=sum+c (10=0+10) and print sum i. e 10
So, The output of code will be 10
