Answer:
li=list(map(str,input().strip().split()))#taking input of the string.
#swapping first and last element.
temp=li[0]
li[0]=li[-1]
li[-1]=temp
print(li)#printing the list.
Explanation:
I have taken the list li for taking the input of strings.Then after that swapping first and last element of the list.Then printing the list.
Answer:
d. It is assumed that the search pool is ordered.
Explanation:
A binary search/logarithimic search/half interval search/binary chop refers to search algorithm in computer science that sorts data in array in key:value arrangements. In order to locate a value in binary search, the key to the value in a sorted array is located. A binary search is characterized by an ascending, descending order arrangement of the array.
Answer:
it would be nice if you gave some form of info here
Explanation:
in other words without information no help aka I'm slow and just need points
Answer:
#include <iostream>
#include <cstdlib>
using namespace std;
int main() {
int[] array = new int[10];
int index = 0;
while(index < array.size()){
int number = (rand() % 100) + 1;
for (int i = 0; i < 1; i++) {
array[index] = number;
cout<< "Position "<< index << "of the array = "<< number << endl;
++index;
}
}
}
Explanation:
The while loop in the source code loops over a set of code ten times, The for loop only loops once to add the generated random number between 1 and 100 to the array of size 10. At the end of the for loop, the index location and the item of the array is printed out on the screen. The random number is generated from the 'rand()' function of the C++ standard library.
Answer:
refers to how much black or white color contains: value,defines a range from dark (0%)to fully illuminated (100%):lightness, Express the brightness or dullness of a color:intensity ,stands for a pure color:hue
HOPE THIS HELPS
