Answer:
C++ code:
#include<iostream>
using namespace std;
void sort(int al[30], int l)
{
//we use insertion sort to sort the array.
int p,q,k;
for(q=1;q<l;q++) //starting from the 2nd item of the array.
{
k= al[q]; //taking qth item as key value.
p=q-1;
while(p>=0 && al[p]>k)
{
al[p+1]=al[p]; //all items those are greaer than al[q] are shifted //to right.
p=p-1;
}
al[p+1]=k;
}
}
int main()
{
int p,l, arrl[30];
cout<<"Enter the number of items in your array: ";
cin>>l;
cout<<endl;
cout<<"Enter your "<<l<<" items"<<endl;
for(p=0;p<l;p++)
{
cin>>arrl[p];
}
sort(arrl, l); //call function sort() to sort the array.
cout<<"The array after sorting: ";
for(p=0;p<l;p++)
{
cout<<arrl[p]<<" ";
}
cout<<endl;
cout<<"The smallest item is: ";
cout<<arrl[0]<<endl;
cout<<"The middle item is: ";
cout<<arrl[l/2]<<endl;
cout<<"The biggest item is: ";
cout<<arrl[l-1]<<endl;
}
Output is given as image.
The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
<h3>What is time complexity of data structures?</h3>
Time Complexity of an algorithm is known to be the depiction of the amount of time needed by the algorithm to carry out to completion.
Note that The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
Learn more about data from
brainly.com/question/17350816
#SPJ1
Answer:
public class Class {
private String name ="";
private int score = 0;
//Method SetName
public void setName(String newName){
name = newName;
}
//Method SetScore
public void setScore(int newScore){
score = newScore;
}
//Method GetName
public String getName() {
return name;
}
//Method GetScore
public int getScore() {
return score;
}
}
Explanation:
- The class called Class is implemented in Java programming language
- It has two fields (instance variables name and score)
- Methods for setting the values of variables (mutator methods) or setters
- Methods for getting the values of the variables (accessor methods) getters
The Answer is toolbar.
<span>The mini or small toolbar contains frequently used formatting commands that are displayed when selecting text or objects with the mouse.
Toolbar is also known as Ribbon. It is present in computer interface design. We can see toolbar in many softwares like Microsoft office suite, web explorer, designing softwares etc. it is mostly present under the menu bar and it has many options.</span>
Answer:
I believe it is science, but before you do anything with this answer, research more on it, just in case I'm wrong! :)
Explanation:
