Iterate over array twice (cartesian product) but consider only half the elements

I am trying to iterate over an array twice to have pairs of elements (e_i,e_j) but I only want the elements such that i < j. Basically, what I want would look like this is C-like languages. ``` int my_array[N] = ...; for (int i=0; i<N; i++) for (int j=i+1; j<N; j++) something(my_array[i],my_array[j]); ``` I didn't find what I was looking for in itertools (the closest thing I've found was `itertools.product(*iterables[, repeat])`). I tried a few things but I am not really convinced by any of them : ``` my_list=range(10) # Using enumerate and slices - explicit loop res=[] for i,j in enumerate(my_list): for k in my_list[i+1:]: res.append((j,k)) print res # Using enumerate and slices - list comprehension res=[(j,k) for i,j in enumerate(my_list) for k in my_list[i+1:]] print res # Using enumerate and xrange - explicit loop res=[] for i,j in enumerate(my_list): for k in range(i+1, len(my_list)): res.append((j,my_list[k])) print res # Using enumerate and xrange - list comprehension res=[(j,my_list[k]) for i,j in enumerate(my_list) for k in range(i+1, len(my_list))] print res ``` I'm still convinced that there is a better and more pythonic solution. Any suggestion is welcome.