I'm working on a homework problem. And I'm having trouble noting what the time complexity is.

A list of N items exists. I iterate through the list to find an item in it (could be anywhere in the list each time). Then I remove the found item. I repeat this until the list is empty.

It's kind of like N*N but the second N is decreasing by 1 each time. How do I explain/denote this problem?

Thanks!