I would say the answer is b, but ⟟ might be wrong
You'll need a helper variable for this, so depending on your programming language, the solution becomes:
int helper;
helper = arr[i];
arr[i] = arr[j];
arr[j] = helper;
Answer:
2^32 times as many values can be represented
Explanation:
32-bit. This means that the number is represented by 32 separate one’s and zero’s. 32 bits of 2 possible states = 2^32=4,294,967,296 possible values.
Integer meaning that only whole multiples of one are accepted.
Signed meaning that negative values are accepted. This halves the number of possible positive values (roughly), so the largest number you can represent is 2^31–1=2,147,483,647, but instead of 0, the smallest number you can represent is -2,147,483,648. An unsigned 32-bit integer, by contrast, can represent anything from 0 to 4,294,967,295.
Answer:
#program in python.
#variables
slice_area=14.125
pi=3.14159
#read diameter
d=int(input("Enter diameter of pizza:"))
#area of pizza
area=pi*(d/2)*(d/2)
#number of slice
no_slice=int(area/slice_area)
#print slice
print("total silce are:",no_slice)
Explanation:
Declare and initialize a variable "slice_area" with 14.125 which is the area of a pizza slice.Initialize a variable "pi" with 3.14159.Then read the diameter of pizza.Find the area of pizza as "area=pi *d/2*d/2".Divide the total area with area of pizza slice.This will be the number of slice.
Output:
Enter diameter of pizza:20
total silce are: 22
The answer is A create a password