-1
votes
0answers
31 views

What are some of the efficient ways to test your algorithms ? [duplicate]

I have just started with competitive programming and must tell you that, I don't have a lot of experience with solving these type of problems. As a result , I started by solving the easiest problems ...
1
vote
4answers
210 views

How to trace logical errors in algorithms [closed]

I am beginner in algorithms. Last year I participated in Google Code Jam. One of the major issues I faced during the competition was my code was working fine on my test cases, but when I submitted on ...
2
votes
1answer
165 views

Strategy for normalising and interpreting location data

I'm a bit stuck with a problem involving the normalisation of location input data from the user (which comes from a third party). Aim To logically breakdown and interpret the user location input ...
0
votes
1answer
385 views

How to test if a hashing algorithm is good? [duplicate]

Possible Duplicate: Which hashing algorithm is best for uniqueness and speed? I have created a hash algorithm and would like to test if it is usable. What do I need to test and how?
5
votes
2answers
126 views

Automated tests for differencing algorithm

We are designing a differencing algorithm (based on Longest Common Subsequence) that compares a source text and a modified copy to extract the new content (i.e. content that is only in the modified ...
11
votes
5answers
758 views

How to do TDD for something with many permutations?

When creating a system like an AI, which can take many different paths very quickly, or really any algorithm that has several different inputs, the possible result set can contain a large number of ...
7
votes
5answers
2k views

How do you identify “edge” cases on algorithms?

Basically how do you find out which could be your worst or best case and any other "edge" cases you might have BEFORE having them and so, how do you prepare your code for them?