试用分别用线性表的向量存储结构和链表存储结构来实现约瑟夫(Josephu)问题。约瑟夫问题如下：



设有n个人围坐圆桌周围。从某个位置上的人开始从1报数，数到m的人便出列，下一个人(第m+1个)又从1报数开始，数到m的人便是第2个出列的人，依次类推，直到最后一个人出列为止，这样就可以得到一个人员排列的新次序。例如，n=8,m=4,从第1个人数起，得到的新次序为48521376.-Trial were linear vector table storage structure and the linked list storage structure to achieve, Joseph (Josephu) problem. Joseph question is as follows: There should be n individuals sitting around the round table. From a position of people began to count off a few people who will be out of the m columns, the next person (the first m+1 month) and from a newspaper a few started to m the number of people is the first two out of out of people, and so on, until the last one out of the column so far, so that you can get an officer ordered a new order. For example, n = 8, m = 4, several individuals from the first one and got a new order of 48,521,376.