Search:

Thanks again for the advice.

I tried to remove the STI prior to the IRET but there seems to still be something seriously wrong.
I get a "Divide overflow" when I execute the program and the system...

I've been told that sometimes the Prim-Jarnik algorithm would be better to implement with an unsorted list instead of a heap -- it is supposedly only better to use the heap when m < (n^2)/log n.
...

The complete program is as follows (edited to assemble on TASM):



.model tiny
.186
.data

olddosint dw 00h,00h

Thank you for a very useful post.

I did indeed fail to realize that I should obviously have assembled this as a COM file. However that didn't help, I get a slightly different garbled output but...

I'm trying to write a TSR (Terminate and Stay Resident) program in DOS. I have an old machine running real DOS 6.2 mostly for nostalgic purposes that I'd like to write my own slowdown utility for....

Oh, forgive my earlier post, I did after all say that my numbers were limited by 10 digits hence 10n is O(n) obviously.

But if the maximum number of digits is indeed k, then it is O(kn), right?

How do you obtain O(n) in radix sort?
Bucket sort is O(n), and bucket sort has to be executed at least k times, where k is the maximum number of digits in the array to be sorted, thus radix sort is...

Input is n integers, but we know that they cannot exceed 10 digits, i.e. the largest number is 10^10

How can we take advantage of this to beat O(n log n)? Obviously sheer bucket sort is out of the...

Seems reasonable, you take the first k integers and create a heap at a cost of O(k) as it is bottom-up.
Then with this heap with k elements you can perform operations in O(log k) time on it.
If...

We have an array A of size n, which contains random positive integers of any size, i.e. not sorted.

What algorithm can find the k largest positive integers in O(n log k) time? Where k is k <= n/2....

In an undirected weighted graph, what algorithm can be used to find a path from a start node, to an end node, s.t. the smallest edge in this path is as large as possible?

E.g. in the attached...

I finally got the hardware itself working now, mapped to /dev/ttyUSB0.

I doubt your MSR is defective -- I get the exact same error as you do, RAM test fails, then I get the "Resource temporarily...

Strange, I'll try a different physical computer, my kernel version is 2.6.30, custom compiled by myself.

I found four devices that show up under /dev by simply comparing what devices are there...

This is strange,
I created all the ttyUSB* devices (from 0 to 255) as specified in the Linux kernel documentation -- despite that, I cannot access the device:

I tried ttyUSB0 and I also tried all...

After compiling the usbserial module and creating the appropriate special character files with mknod I get the following when I connect the device:

usb 2-2: Manufacturer: Prolific Technology Inc....

I tried libmsr but I actually can't get it to work at all -- my MSR505C doesn't show up as a physical USB device; may I ask what kernel module/option and what device (under /dev ) you used in...

Hi, I just wanted to say that I own a MSR505C as well and I'm also having issues with the demo software, although my problem is that I'm unable to write to a specific card -- I simply get an error...

The example with the a,b,c graph is far from clear to me:

Iteration: 0 1 2 3
---------------------------------
Node A: 0 0 0 0
Node B: inf 2 2 1
Node C: inf 3 3 ...

I know Dijkstra's algorithm does not handle negative edges on a general basis, I'm not disputing that, however to me it is not clear _why_ Dijkstra doesn't handle negative edges; I have two books on...

I thought it was impossible to sort faster than O(n * log n),
but according to my algorithms professor it is possible to sort any array of integers x[1 ... n] in O(n + M) time where M = max_i(x_i) -...