*演算法與資料結構 - Josephus problem
(Algorithms & Data Structures - Josephus problem)
*References:
https://en.wikipedia.org/wiki/Josephus_problem http://mathworld.wolfram.com/JosephusProblem.html
L3_A
Method 1 :演算法採用模擬方式，資料結構採用Array，移除陣列元素法
(Method 1 : Algorithm by simulation，Data structure using Array and by removing component)
Method 2 :演算法採用模擬方式，資料結構採用Array，標記陣列元素法
(Method 2 : Algorithm by simulation，Data structure using Array and by marking component )
L3_B
Method 3 :演算法採用模擬方式，資料結構採用Circular Linked List
(Method 3 : Algorithm by simulation，Data structure using Circular Linked List)
L3_C
Method 3 :演算法採用模擬方式，資料結構採用Circular Linked List
(Method 3 : Algorithm by simulation，Data structure using Circular Linked List)
Method 4 :演算法採用模擬方式，資料結構採用Array 加上 Node struct
(Method 4 : Algorithm by simulation，Data structure using Array plus Node struct)
L3_D
Method 4 : 遞迴
(Method 4 : Recursion)
講解作業-Linked lists補充說明
(Supplement explanations of linked lists)
.png)
