Answer:
see explaination
Explanation:
void insertion( int e,int *x, int start, int end)
{
if (e >= x[end])
x[end+1] = e;
else if (start < end)
{
x[end+1] = x[end];
insertion(e, x, start, end-1);
}
else
{
x[end+1] = x[end];
x[end] = e;
}
}
void insertion_recurssion(int *b, int start, int end)
{
if(start < end)
{
insertion_sort_recur(b, start, end-1);
insertion(b[end], b, start, end-1);
}
}
void main()
{
insertion_recurssion(x,0,5);
}
Answer:
Internet and communication technology
Answer:
public static int maxMagnitude(int a, int b){
int max;
if (a>b){
max = a;
}
else{
max = b;
}
return max;
}
The complete program calling the method is given in the explanation section
Explanation:
import java.util.Scanner;
public class ANot {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("Please Enter two numbers");
int num1= in.nextInt();
int num2 = in.nextInt();
System.out.println("The largest magnitude number is: "+maxMagnitude(num1,num2));
}
public static int maxMagnitude(int a, int b){
int max;
if (a>b){
max = a;
}
else{
max = b;
}
return max;
}
}
The maxMagnitude() method uses if/else statement to compare two ints and return the larger one
Answer:
Explanation:
The following code is written in Python and creates a tuple of 5 integer numbers and then prints out the tuple. Tuples are immutable objects meaning that they cannot be changed at all. Therefore, they have no append methods and cannot have any values added or removed so the last two tasks of this question are impossible to accomplish.
my_tuple = (2, 5, 7, 9, 6)
print(my_tuple)
