Answer:
oid changeCase (char char_array[], int array_size ) {
__asm{
mov eax, char_array;
mov edi, 0;
readArray:
cmp edi, array_size;
jge exit;
mov ebx, edi;
shl ebx, 2;
mov cl, [eax + ebx];
check:
//working on it
cmp cl, 0x41;
jl next_indx;
cmp cl, 0x7A;
jg next_indx;
cmp cl, 'a';
jl convert_down;
jge convert_up;
convert_down:
or cl, 0x20; //make it lowercase
jmp write;
convert_up:
and cl, 0x20;
jmp write;
write:
mov byte ptr [eax + ebx], cl
next_indx:
inc edi;
exit:
cmp edi, array_size;
jl readArray;
mov char_array, eax;
}
}
Explanation:
- Move char_array to eax as it is base image
.
- Use ebx as offset
.
- Use ecx as the storage register
.
- check if cl is <= than ASCII value 65 (A)
.
Answer:
see explaination
Explanation:
import random
def number_guess(num):
n = random.randint(1, 100)
if num < n:
print(num, "is too low. Random number was " + str(n) + ".")
elif num > n:
print(num, "is too high. Random number was " + str(n) + ".")
else:
print(num, "is correct!")
if __name__ == '__main__':
# Use the seed 900 to get the same pseudo random numbers every time
random.seed(900)
# Convert the string tokens into integers
user_input = input()
tokens = user_input.split()
for token in tokens:
num = int(token)
number_guess(num)
It is because many people want to be perfect just at the start, but there is always room to improvement, but people don't accept that, so they don't want to be better than what they are already, so the don't revise themselves or anything.
I think coders put in codes. Sry if that does not help.
