Answer:
n := length(A)
repeat
swapped := false
for i := 1 to n-1 inclusive do
<em> /* if this pair is out of order */</em>
if A[i-1] > A[i] then
<em> /* swap them and remember something changed */</em>
swap(A[i-1], A[i])
swapped := true
end if ⇒
end for
until not swapped
end procedure
Explanation:
This is pseudocode
Answer:
numX = 3
Explanation:
First, let's analyze what the code is showing:
If both conditions in the if-statement are true, then numX = 3. If one or both conditions are false, then numX = 7 ('and' means that both conditions have to be true for the if-statement to become true).
- this statement is true.
!=
- this statement is also true (!= means 'not equal').
Since both conditional statements are true, then numX must equal .
Hope this helps :)
Answer:
Hope it helps.have a look.
