• Assume you can physically walk along the red array (from either end).
  • As you walk, you "visit" each element (i.e. "B")
  • Assume when you visit any element you can throw the element to the blue array (you have a strong arm)
  • Is there any way you could walk along the red array, in one direction, from end-to-end, and "throw" elements into the blue array to reverse the order?
  • If so, is there a pattern (logic) as to how you did it?






























Data Structures And Algorithms (DSA) (Chapter 103 - OO Algorithms I)










Chapter 103 - OO Algorithms I Walking the Array

Contents Intro How-To Examples Recap Lessons Learned Challenge

Chapter Top Search TOC