An O(N) Seat Assignment Algorithm

Abstract

This paper presents a fast channel assignment algorithm based on the famous Left-Edge Algorithm (LEA) and the data structure of buckets for printed circuit boards, electronic design automatic, and internet scheduling. Meanwhile, this algorithm can be applied to rails traffic management system with the minimal number of seats. The time and space complexities are both O(N), where N is the number of tickets under the condition that the number of stations is limited.