Given an unsorted sequence, S , of integers and an integer k , describe a recursive algorithm for rearranging the elements in S so that all elements less than or equal to k come before any elements...

Given an unsorted sequence,
S, of integers and an integer
k, describe a

recursive algorithm for rearranging the elements in
S
so that all elements

less than or equal to
k
come before any elements larger than
k. What is

the running time of your algorithm on a sequence of
n
values?

Develop a nonrecursive implementation of the version of power from

Code Fragment 4.12 that uses repeated squaring.