Josephs Problem

void JosuphProb(int jump){
	node *temp = head;
	node *temp1 = head;
	while (temp != head)
	for (int i = 0; i < jump - 2; i++){
		temp = temp->next;
	}
	for (int i = 0; i < jump - 1; i++){
		temp1 = temp1->next;
	}
	temp->next = temp1->next;
	temp1 = temp;
	if (temp == head){
		head = head->next;
	}
}