Abstract: This paper discusses a sorting pattern that is able to sort objects automatically.The sorter consists of a multilevel Haffman tree.When a group of objects move "from top to bottom" along a given device of a Haffman tree shape,they will besorted into different subgroups according to their category attributes.Which direction should be taken for a moving object while passing through a node is the key point.Thepaper suggests two types of code formats,one for trunk nodes,the other for leafnodes.The latter represents the category attributes and the final destinations.Because of these formats,a simple logical multiplication is enough for a moving body to determine the direction to take when meeting with a node in the tree.Finally the paper gives two data sets and the algorithm for solving the problem.