Answer:
The answer is creators.
Explanation:
<em>Creators are contributors capable to inovate and share creative ideas. They are not necessarily advertising and marketing professionals. They can have art, design, music, and other backgrounds, but the most relevant characteristic of this group of people is their creativity.</em>
<em>They are behind all the great ideas we see at the most relevant social medias nowadays.</em>
Answer:
We will use script in oracle and SQl(Structured Query Language) and use of algorithms like cipher for encryption to insert a new flight into the flights table for the flight number 165 and that Cipher will show the desired message.
The problem with the swap function is that it loses the value at the first index, as soon as it gets overwritten by the value at the second index. This happens in the first statement. To fix it, you need a helper variable.
First you're going to "park" the index at the first index in that helper variable, then you can safely overwrite it with the value at the second index. Then finally you can write the parked value to the second index:
var swap = function(array, firstIndex, secondIndex) {
let helper = array[firstIndex];
array[firstIndex] = array[secondIndex];
array[secondIndex] = helper;
};
I hope this makes sense to you.
Answer:
Answer explained below
Explanation:
void bubbleSort(int X[], int Y[], int n)
{
int i, j;
for (i = 0; i < n-1; i++)
// Last i elements are already in place
for (j = 0; j < n-i-1; j++)
if (X[j] > X[j+1])
{
swap(X[j],X[j+1])
swap(Y[j],Y[j+1]);
}
if (X[j] == X[j+1]&&Y[j]<Y[j+1])
{
swap(X[j],X[j+1])
swap(Y[j],Y[j+1]);
}
}
Since the above algorithm contains 2 nested loops over n.
So, it is O(n^2)
Answer:
See explaination
Explanation:
MinMax.java
import java.util.*;
public class MinMax
{
static void MinMax(int[] arr)
{
int Min=arr[0]; // initializinf min and max with 1st value of array
int Max=arr[0];
for(int i=0;i<arr.length;i++) // iterating loop only once
{
if(arr[i]>Max) // checking max value
{
Max=arr[i];
}
if(arr[i]<Min) // checking min value
{
Min=arr[i];
}
}
System.out.println("Min Number is "+Min); //printing min value
System.out.println("Max Number is "+Max); //printing max value
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter N value: "); // taking n value
int n=sc.nextInt();
int[] arr=new int[n];
System.out.println("Enter N elements:"); // taking n elements into array
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt(); // each element into the array
}
MinMax(arr); // calling MinMax() method.
}
}
