In C++ please

3) In an UnSortedList, the programmer decides to use the following algorithm to remove an item: find item position swap(item, last element) decrement count Estimate the Big-O order of this approach. How does it compare via Big-O with the standard removal algorithm for a list (see the side note!)? find item, shift to overwrite and preserve contiguity, decrement count How does it compare practically in real performance - with the standard algorithm