I need a program to solve Josephus problem using Single Circular Linked List, which should have such functions as
insert, print and josephus. First read input from the user, which specifies the function to be executed, where ‘i’-insert, ‘p’-print ,
‘j’-josephus and ‘e’-exit. Then execute function of the list in the order of selection.
void insert(int info) – puts specific value into the list.
void print() – print out all elements of the list.
void josephus(int countdown) – if the list is not empty print out the last elements or shows “List is empty”, otherwise.
Note: The list is not sorted and elements can be positioned in any order. And countdown can be larger than the size of the list.
i 5 5 2 6 8 1 3 6
i 2 6
i 6 6
Double Circular Linked List, which has such function as insert, print, reverse and find MinPath. Read
the character that specifies the user choice, where ‘i’-insert, ‘p’-print, ‘r’-reverse and ‘f’- finMinPath. The task is to find
minimum number of nodes between 2 particular nodes with specific values if they exist.
7 freelancers are bidding on average $31 for this job
Hello,I will do simplest coding in C++,C using OOP,data structures [login to view URL] looks like an assignment so coding will be easily understandable for u.I have done many C++ works [login to view URL] have a chat. Thanks.
I have 12+ years of experience in C/C++ on Windows,Linux,Embedded, so i can do your work for Josephus problem using Single Circular Linked List, ,kindly ping me to discuss further
I am a second year computer engineering student and we get this kind of assignments fairly regularly. I feel like this will be an easy task for me and I have a lot of time on my hands.