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: Let us use the pickled file - DeckOfCardsList.dat.
Explanation: So that our possible outcome becomes
7♥, A♦, Q♠, 4♣, 8♠, 8♥, K♠, 2♦, 10♦, 9♦, K♥, Q♦, Q♣
HPC (High Point Count) = 16
Answer:
The final velocity of the rocket is 450 m/s.
Explanation:
Given;
initial velocity of the rocket, u = 0
constant upward acceleration of the rocket, a = 18 m/s²
time of motion of the rocket, t = 25 s
The final velocity of the rocket is calculated with the following kinematic equation;
v = u + at
where;
v is the final velocity of the rocket after 25 s
Substitute the given values in the equation above;
v = 0 + 18 x 25
v = 450 m/s
Therefore, the final velocity of the rocket is 450 m/s.
Answer:
An oscilloscope display grid or scale is called a graticule.
Explanation:
