list-comparison

Possible Duplicate: Is there a built-in method to compare collections in C#? What is the best way to compare to generic two generic lists in C# 3.0? If you want to compare regardless of element order, try the UnorderedEqual<T> method from here: C# List Element Equality Otherwise: var list1 = new List<int> { 1, 2, 3 }; var list2 = new List<int> { 1, 2, 3 }; var areSame = Enumerable.SequenceEqual(list1, list2); Rohan West Check out this answer , it provides a method that determines whether two sequences contain the same elements. If you want to compare two sequences in .NET 3.5 and beyond (that

How can I test if a list contains another list (ie. it's a contiguous subsequence). Say there was a function called contains: contains([1,2], [-1, 0, 1, 2]) # Returns [2, 3] (contains returns [start, end]) contains([1,3], [-1, 0, 1, 2]) # Returns False contains([1, 2], [[1, 2], 3]) # Returns False contains([[1, 2]], [[1, 2], 3]) # Returns [0, 0] Edit: contains([2, 1], [-1, 0, 1, 2]) # Returns False contains([-1, 1, 2], [-1, 0, 1, 2]) # Returns False contains([0, 1, 2], [-1, 0, 1, 2]) # Returns [1, 3] Here is my version: def contains(small, big): for i in xrange(len(big)-len(small)+1): for j in