In Progress

1. Josephus problem using Single Circular Linked List and 2. Double Circular Linked List, which has such function as insert, print, reverse and find MinPath.

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.

Constraints:

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.

(0<countdown<231).

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.

Input: output:

i 5 5 2 6 8 1 3 6

i 2 6

i 6 6

i 8

i 1

i 3

i 6

p

j 5

p

e

2.

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.

Skills: C++ Programming

See more: josephus circle using circular linked list java, josephus circle using circular linked list python, josephus problem using circular linked list in c, josephus circle using circular linked list in c, josephus problem using linked list in c++, josephus problem solution in c using circular linked list, josephus problem linked list in c, josephus problem c++ circular list, motor control using single switch, business process outsourcing problem using linear programming, maximization problem using excel, layout motor control using single switch, multiple actions using single jsp struts, problem using mobile phone, java code using double linked list, code travelling salesman problem using nearest neighbour algorithm, flight map search problem using, producer consumer problem using fork, circular linked list using recursion program, circular linked list program using

About the Employer:
( 0 reviews ) Seoul, Korea, Republic of

Project ID: #24845192

7 freelancers are bidding on average $31 for this job

hbxfnzwpf

I am very proficient in c and c++. I have 18 years c++ developing experience now, and have worked for more than 10 years. My work is online game developing, and mainly focus on server side, using c++ under Linux enviro More

$50 USD in 1 day
(117 Reviews)
6.8
iridescent2x15

Hi I have done many c++ projects. Kindly contact to share more details about your project in chat. Thank you

$30 USD in 7 days
(53 Reviews)
5.8
harissheikh255

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.

$30 USD in 1 day
(27 Reviews)
4.3
amoldhanwat

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

$25 USD in 1 day
(3 Reviews)
1.7
omarmoghazy

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.

$20 USD in 1 day
(0 Reviews)
0.0
vra568f98e757018

I can do this in free of cost. i have done many things on circular list. it looks like not new for me.

$10 USD in 7 days
(0 Reviews)
0.0
technowise38

Hello, I've just gone through job description carefully and am interested. I have rich experience in these fields. I am working in these fields for years, so I have enough confidence with these kinds of projects. If yo More

$55 USD in 1 day
(0 Reviews)
0.0