Can you implement this quick sort algorithm in C++ for me and write a test main program for it. Algorithm QuickSort(S): Input: A sequence S implemented as an array or linked list Output: The sequence...

Can you implement this quick sort algorithm in C++ for me and write a test main program for it.

Extracted text: Algorithm QuickSort(S): Input: A sequence S implemented as an array or linked list Output: The sequence S in sorted order if S.size() < 1="" then="" return="" p-s.back(element()="" let="" l,="" e,="" and="" g="" be="" empty="" list-based="" sequences="" while="" !s.empty="" )="" do="" {scan="" s="" backwards,="" dividing="" it="" into="" l,="" e,="" and="" g}="" if="" s.back().element()="">< p="" then="" (l.jnsertback(s.eraseback())="" elşe="" if="" s.back().element()="p" then="" ensertback(s.eraseback())="" else{the="" last="" element="" in="" s="" is="" greater="" than="" p}="" g.jnsertback(s.eraseback())="" quicksort(l)="" quicksort(g)="" while="" !l.empty()="" do="" {copy="" back="" to="" s="" the="" sorted="" elements="" less="" than="" p}="" s.insertback(l.erasefront())="" while="" !e.empty()="" do="" {copy="" back="" to="" s="" the="" elements="" equal="" to="" p}="" s.insertback(e.erasefront())="" while="" !g.empty="" ()="" do="" {copy="" back="" to="" s="" the="" sorted="" elements="" greater="" than="" p}="" s.insertback(g.erasefront()="" {s="" is="" already="" sorted="" in="" this="" case}="" {the="" pivot}="" {recur="" on="" the="" elements="" less="" than="" p}="" {recur="" on="" the="" elements="" greater="" than="" p}="" return="" {s="" is="" now="" in="" sorted="" order}="" code="" fragment="" 11.5:="" quick-sort="" for="" an="" input="" sequence="" s="" implemented="" with="" a="" linked="" list="" or="" an="">