Banyan Properties

• clever arrangement avoids collisions given ordered destinations

• begins with “perfect shuffle” pattern

• Banyan with n inputs needs:

  • log n stages
  • n/2 elements per stage

• Overall complexity is n log n

Previous slide

Next slide

Back to first slide

View graphic version