Answer:
insert (array[] , value , currentsize , maxsize )
{
if maxsize <=currentsize
{
return -1
}
index = currentsize-1
while (i>=0 && array[index] > value)
{
array[index+1]=array[index]
i=i-1
}
array[i+1]=value
return 0
}
Explanation:
1: Check if array is already full, if it's full then no component may be inserted.
2: if array isn't full:
- Check parts of the array ranging from last position of range towards initial range and determine position of that initial range that is smaller than the worth to be inserted.
- Right shift every component of the array once ranging from last position up to the position larger than the position at that smaller range was known.
- assign new worth to the position that is next to the known position of initial smaller component.
Answer:
resistance
Explanation:
A strain gauge changes resistance with applied strain.
Answer:
see explaination
Explanation:
Please kindly check attachment for the step by step solution of the given problem.
The attached files has the solved problem.
DNA translates to the genetic code
Answer:
Explanation:
import java.util.Scanner;
public class NestedLoops {
public static void main (String [] args) {
Scanner scnr = new Scanner(System.in);
int numRows;
int numColumns;
int currentRow;
int currentColumn;
char currentColumnLetter;
numRows = scnr.nextInt();
numColumns = scnr.nextInt();
for (currentRow = 0; currentRow < numRows; currentRow++) {
currentColumnLetter = 'A';
for (currentColumn = 0; currentColumn < numColumns; currentColumn++) {
System.out.print(currentRow + 1);
System.out.print(currentColumnLetter + " ");
currentColumnLetter++;
}
}
System.out.println("");
}
}
2
3
1A 1B 1C 2A 2B 2C
thanks