The Shaker sort or (bidirectional bubble sort)
Chapter 3, Problem 20E(choose chapter or problem)
The Shaker sort or (bidirectional bubble sort) successively compares pairs of adjacent elements, exchanging them if they are out of order, and alternately passing through the list from the beginning to the end and then from the end to the beginning until no exchanges are needed.Show that nn is not O (n!).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer