Download presentation
Presentation is loading. Please wait.
1
Josephus
2
Josephus Problem A given number of people standing in a circle (N people)
3
Josephus Problem A given number of people standing in a circle (N people) Counting begins at a specified point in the circle and proceeds around the circle in a specified direction.
4
Josephus Problem A given number of people standing in a circle (N people) Counting begins at a specified point in the circle and proceeds around the circle in a specified direction. After a specified number of people are skipped, the next person is executed.
5
Josephus Problem A given number of people standing in a circle (N people) Counting begins at a specified point in the circle and proceeds around the circle in a specified direction. After a specified number of people are skipped, the next person is executed. Repeat this procedure with the remaining people. Stop when there is only one person remain.
6
Josephus Problem A given number of people standing in a circle (N people) Counting begins at a specified point in the circle and proceeds around the circle in a specified direction. After a specified number of people are skipped, the next person is executed. Repeat this procedure with the remaining people. Stop when there is only one person remain.
7
ListIterator ListIterator extends Iterator
8
ListIterator ListIterator extends Iterator It is an interface
9
ListIterator ListIterator extends Iterator It is an interface
10
ListIterator ListIterator extends Iterator It is an interface
11
ListIterator ListIterator extends Iterator It is an interface
No current element, but the position
12
ListIterator ListIterator extends Iterator It is an interface
No current element, but the position
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.