5 ms·
In reality it is so difficult to identify honest-to-goodness plagarism in comp sci. For instance, in my algorithms courses, wikipedia was super useful. Most sig
by eqdw 16y ago
In reality it is so difficult to identify honest-to-goodness plagarism in comp sci. For instance, in my algorithms courses, wikipedia was super useful. Most significant algorithms (e.g. quicksort) have a pseudo-code implementation, and when you look them up, it's really hard work to NOT make yours look identical. How do you deal with that situation?
Answer: you deal with it in the way my algo prof did. We implemented algorithms so we could compare performance. So he'd say, for instance, "write libraries in C to implement a binary, ternary, and quaternary heap. Then, write code to track how many data accesses there are, run all three on test input, and compare results". It doesn't matter if you're copying the algorithm from online; if you don't understand the algorithm then you won't know exactly what you're tracking.