Answer:
b. selection sort
b. 8 11 17 30 20 25
Explanation:
The options above are the correct answers to the given questions.
Selection sort is a simple comparison-based sorting algorithm.
selection sort. (algorithm) Definition: A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. The run time is Θ(n²), where n is the number of elements. The number of swaps is O(n).
It is this sorting algorithm that will best ne suitable in the given event.
Answer:
The answer to this question is given below in the explanation section.
Explanation:
#include <iostream>
// it is preprocessor director that manipulate the input output in the program
using namespace std;// it is used to format input and output
int main() {
// main function is started
int x = 5;
// variable x is declared and initialized with value 5.
int y = 6;
//variable y is declared and initialized with value 6.
int z = 34; //variable z is declared and initialized with value 34.
int total = (x+(x + y)*z+y);
// variable total is declared and initialized with value of x,y,and z. and calculation performed on these value such as (5+(5+6)*34+6) that is equal to 385.
cout << total;
// print the value of total variable that is 385
return 0;
}
what is mean by computers
Answer:
1. To avoid being robed
2. To Keep your identity safe
Explanation:
Hope this helps! (:
Answer:
The answer is "Software as a service".
Explanation:
The software license strategy permits access to the software via a remote server through subscription-based access to the software. Rather than installing software on each user's PC, SaaS lets them access applications via the Internet.
For a number of reasons, it could save you money. Purchase/installation costs and also ongoing maintenance and upkeep are avoided, which is the primary benefit. SaaS apps may be easily downloaded and managed without breaking the bank on hardware parts and upgrades.
