Hacker Newsnew | past | comments | ask | show | jobs | submit | pilord314's commentslogin

A disassembly diff tool:

input <- old_image new_image

output -> report

Example summary:

================================================================================

TOTAL

================================================================================

  -20 insns, -40 bytes (c.insn→insn +40b)  [spill -22, cmov +3, call -2, br -1]  mem +13, alu -6, mv -4, bitmanip -1

  Added/Removed: +0 / -220 bytes

  Functions: 4 better (-20 insns), 0 worse (+0 insns), 1 removed, 1062 unchanged

When you get into C code sometimes you know the most thinngs that will be in the priority queue is like 3. So bubble sort is fine.

You can also do something like a calendar queue with bubble sort for each bin.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: