laehc

The obvious way to compile a while-loop is with a conditional branch at the start and an unconditional branch at the end to loop back. Suppose the condition is A>B, then a conditional branch at the end testing A<=B will fall through when the loop is done, instead of jumping …

I'm guessing you are either struggling with the basics or not bothering to do the work. I'm only answering 1. A XOR B = AB' + A'B [code]A B A XOR B AB' A'B AB'+A'B 0 0 0 0 0 0 0 1 1 0 1 1 1 0 0 …

I can't get anything useful from GDB 6.8 (GNU debugger) on a program compiled with gfortran. I compiled testprog.exe with gfortran using the flags -g and -o (and no other flags) with gcc version 4.5.0. It runs OK, I tried using GDB with it to learn about GDB, but without …

I've never written pseudocode before so I don't know about the style. 1) Simple but not efficient: list=empty for integer i=1 to n if i divides n exactly put i in the list end if end for sort the list print the list That's probably some horrible mix of Fortran …

Here's an easy way to get: 1 + 2 + 3 + ... + n = n(n+1)/2 Taking n=6, write the sum underneath in reverse order, and add each column like this: 1 + 2 + 3 + 4 + 5 + 6 6 + 5 + 4 + 3 …

I recently unrolled an insertion sort and on 60 items it was twice as slow as the looped version. I'm guessing that's because it was too big for the instruction cache, being 1032 KB. First, does that seem a likely explanation? If so, to avoid that problem, do I just …

Good luck. I've seen claims that radix sort is time-linear but I've seen it debunked and I'm inclined to believe the debunking. Unfortunately I can't find the articles. I think it depends on the number of different values that the key you are sorting on can take. Imagine a list …