Answer:
where glasses gloves turn on the power tool
Explanation:
Answer:
Step 1 - Open the View tab.
Step 2 - Open the Page Setup dialog box
Step 3 - Open the header and footer tool.
Step 4 - Click OK.
Explanation:
In order to access to the header and footer tools
Step 1 - Open the View tab.
Step 2 - Open the Page Setup dialog box
Step 3 - Open the header and footer tool.
Step 4 - Click OK.
Answer: static
Explanation:
In java we have the static keyword to indicate that it can be called without creating an object of the class.
example :
public static void main(String arg[])
So, main can be called without creating an object of the class.
There is no "best" programming language. Each programming language has it's one purpose. HTML is used for the skeleton of the web page. CSS is used to style the HTML. Javascript and javascript libraries like jQuery are used to make a web page more interactive. PHP is used to make a web page dynamic. MYSQL used to manage databases. Not all languages are for strictly for web page development. Ruby is an example. But Ruby on Rails is for web development. Some languages are used for making programs. Such as C, C++, C#. There are all sorts of programming languages. Some more popular than others. I have learned multiple programming languages and I have my favorites. If you go to learn multiple languages, I am pretty sure you're gonna have a favorite.
It basically comes down to what programming language you want to learn.
Answer:
#include <iostream>
using namespace std;
void swap(int *a,int *b){ //function to interchange values of 2 variables
int temp=*a;
*a=*b;
*b=temp;
}
void sort(int queue[],int n)
{
int i,j;
for(i=0;i<n;i++) //to implement bubble sort
{
for(j=0;j<n-i-1;j++)
{
if(queue[j]>queue[j+1])
swap(queue[j],queue[j+1]); //to swap values of these 2 variables
}
}
}
int main()
{
int queue[]={6,4,2,9,5,1};
int n=sizeof(queue)/4; //to find length of array
sort(queue,n);
for(int i=0;i<n;i++)
cout<<queue[i]<<" ";
return 0;
}
OUTPUT :
1 2 4 5 6 9
Explanation:
In the above code, Queue is implemented using an array and then passed to a function sort, so that the queue can be sorted in ascending order. In the sort function, in each pass 2 adjacent values are compared and if lower index value is greater than the higher one they are swapped using a swap function that is created to interchange the values of 2 variables.
