Create Josephus.go

Author: careermonk

src/chapter03linkedlists/Josephus.go

@@ -0,0 +1,64 @@
+# Copyright (c) Dec 22, 2014 CareerMonk Publications and others.
+# E-Mail           		: info@careermonk.com 
+# Creation Date    		: 2014-01-10 06:15:46 
+# Last modification		: 2008-10-31 
+#               by		: Narasimha Karumanchi 
+# Book Title			: Data Structures And Algorithms Made In Java
+# Warranty         		: This software is provided "as is" without any 
+# 				   warranty; without even the implied warranty of 
+# 				    merchantability or fitness for a particular purpose. 
+
+package main
+
+import (
+	"fmt"
+)
+
+type ListNode struct { // defines a ListNode in a singly linked list
+	data interface{} // the datum
+	next *ListNode   // pointer to the next ListNode
+}
+
+// Create a new node of circular linked list
+func newListNode(data int) *ListNode {
+	temp := &ListNode{}
+	temp.next = temp
+	temp.data = data
+	return temp
+}
+
+// Function to find the only person left after one in every m-th node is killed in a circle of n nodes
+func getJosephusPosition(m, n int) {
+	// Create a circular linked list of size N.
+	head := newNode(1)
+	prev := head
+	for i := 2; i <= n; i++ {
+		prev.next = newListNode(i)
+		prev = prev.next
+	}
+	prev.next = head // Connect last node to first
+
+	// while only one node is left in the linked list
+	ptr1, ptr2 := head, head
+	for ptr1.next != ptr1 {
+		// Find m-th node
+		count := 1
+		for count != m {
+			ptr2 = ptr1
+			ptr1 = ptr1.next
+			count++
+		}
+
+		// Remove the m-th node
+		ptr2.next = ptr1.next
+		ptr1 = ptr2.next
+	}
+
+	fmt.Println("Last person left standing ", "(Josephus Position) is ", ptr1.data)
+}
+
+// Driver program to test above functions
+func main() {
+	n, m := 14, 2
+	getJosephusPosition(m, n)
+}