Answer:
6 2 and 0
Explanation:
This algorithm doesn't work if the list is not ordered ascending.
In this example it is not, and indeed the item "1" is never found.
first cycle: first=0, last=12 so midpoint=6
second cycle: first=0, last=5 so midpoint=2
last cycle: first=0, last=1 so midpoint=0
then last is assigned -1 so the while statement is no longer true.
Answer:
Expression for the above problem in python language:
userNum=int(input("Enter the value of user_Num")) #it is used to take input.
if(userNum>(-10)): #if statement
print("The value of the userNum is greator")
elif(userNum==(-10)): #elif statement
print("The value of the userNum is equal to -10")
else: #else statement.
print("The value of the userNum is small")
Output:
- If the user input is (-10), it will print equal.
- If the user input 10, it will print greator message.
Explanation:
- The above program or expression is in python language, where the first line is used to render a message to the user take the input and store it into a userNUM variable.
- Then the second line is used to check the user num value to be greater with the help of if statement.
- Then the third statement is used to check the user num value to be equal with the help of elif statement.
- Then the else statement will execute when the if and the elif statement will not true.
Answer:
Chord is a set of rules for a peer-to-peer distributed hash table it collects key-value sets by allotting keys to several computers (known as "nodes"); a node will collect the values for all the keys for which that is reliable. Chord defines how keys are allocated to the nodes, and how a node can determine the value for a distributed key by first locating the node liable for such key.
Explanation:
A chord is a peer-to-peer lookup service. It Resolves the difficulty of establishing a data item in a combination of shared nodes, considering various node arrivals and removals The most crucial operation in most peer-to-peer method is the efficient position of data objects.
It is able of supporting only one operation i.e. given a key, it maps the key on a link.
Algorithm:
Algorithm shows working of the chord:
// x is a node used to find successor of id
x.find_successor(id)
if (id (x; successor])
return successor;
else
// query is being delivered around the circle
entrance successor.find_successor(id);
I believe it is corn. ethanol can be produced from corn biomass, and is commonly used to make gasoline. i’m not sure if this answers your question, or counts as a type of energy but i tried.
