Funny enough, it's probably a stack overflow problem


The following procedure (explanation follows) works fine for really small lists, but when the list contains a larger number of items (1/2 million) the application enters "not responding" state,and it takes about 2.5 minutes to finish (very bad time). I might add the application needs to process lists of 100 million items at least (eventually).

here is the code for the problematic procedure:

    public void removeItems(List<long> L, SortedList<long, List<long>> _subLists)
        foreach (KeyValuePair<long, List<long>> kvp in _subLists)
            foreach (long duplicate in kvp.Value)
                int j = L.IndexOf(duplicate);


L is a list of long values. _subLists is a sorted list where each value is a list of values from L,starting an arithmetic progression series of some difference (not relevant). the key associated with that value is the length of the series the values contain.


L = {1,2,3,5,6,7,18,20,21} _subLists = {2,<20>} {3,<1,5>}

The procedure simply removes the arithmetic progression series from L.

The run time of this procedure in big O notation would be n^2, which is fairly slow and you can expect a slow run time if one of the lists has 100 million entries. There is no stack overflow problem here, it's simply slow to iterate through this much data. I don't really see a question here, are you looking to make this faster? If so, the nested for loop is definitely the problem.