Can you give me further explanation? For example, how is your phone not letting you download things? What model of a phone is it? what update is it on? and to what extent can you download something?
Answer:
If this is actually college then thats weird cuz im in middle school and im doing this stuff. And the answer is wireless networks
Explanation:
Answer:
weweweweweewewwewweewewweeew
Explanation:
weweweweewweweweewweewweewewew
Answer:
//C++ code for the cash register..
#include <iostream>
#include<vector> //including vector library
using namespace std;
int main() {
vector<float> cash; //declaring a vector of type float.
float item=2,cash_sum=0;
int counter=1;
while(item!=0)//inserting prices in the vector until user enters 0...
{
cout<<"Enter the price of item "<<counter<<" :"<<endl;
cin>>item;
counter++;
cash.push_back(item);//inserting element in the vector...
}
for(int i=0;i<cash.size();i++)//looping over the vector...
{
cash_sum+=cash[i];//summing each element..
}
cash_sum*=1.08;//adding 8% sales tax.
cout<<cash_sum;//printing the result....
return 0;
}
Explanation:
I have taken a vector of type float.
Inserting the price of each item in the vector until user enters 0.
Iterating over the vector for performing the sum operation.
Then after that adding 8% sales tax to the sum.
Printing the output at last.
Answer: The shell sort is based on insertion sort. Here the list of elements are divided into smaller sub list which are sorted based on insertion sort.
Its best case time complexity is O(n* logn) and worst case is O(n* log^2 n)
Explanation:
Shell sort is an inplace sorting here we begin by dividing the list into sublist and sorting the list with insertion sort. We create interval for dividing the list into sub list until we reach the smallest interval of 1.
The best case is O(n* logn).
