QuantumPhysics @ Wed Jan 30, 2013 10:44 am wrote:
2. e (unless your teacher reads from the textbook)
5. d
6. None of those
7. 0 times, do {
asm(
reg ebx,50
pop ebx
)
}while(int __cdecl ebx = 0);
13. I think it would be (d) because even though they all swap, out of those the best would be search because as it moves through passes it still has find if one number is greater than the other.
a searching algorithm would be something like binary search or linear search, those are sorting algorithms, you dont search for the numbers so much as realize they are there and compare them