Adding activity-selection algo

Author: bhavnavarshney

Go/greedy/activity_selection.go

@@ -0,0 +1,43 @@
+/*
+Activity Selection Problem
+You are given n activities with their start and finish times. Select the maximum number of activities
+that can be performed by a single person, assuming that a person can only work on a single activity at a time.
+*/
+
+package greedy
+
+import (
+	"fmt"
+	"sort"
+)
+
+type activity struct {
+	startTime int
+	endTime   int
+	no        int
+}
+
+func ActivitSelection() {
+	a := []activity{
+		{5, 9, 1}, {1, 2, 2}, {3, 4, 3}, {0, 6, 4}, {5, 7, 5}, {8, 9, 6},
+	}
+	n := len(a)
+	sort.SliceStable(a, func(i, j int) bool {
+		return a[i].endTime < a[j].endTime
+	})
+	orderOfActivities := activitySelection(a, n)
+	fmt.Println(orderOfActivities)
+}
+
+func activitySelection(a []activity, n int) []activity {
+	result := make([]activity, n)
+	result[0] = a[0]
+	j := 0
+	for i := 1; i < n; i++ {
+		if a[i].startTime >= a[j].endTime {
+			result[i] = a[i]
+			j = i
+		}
+	}
+	return result
+}

Go/main.go

@@ -3,17 +3,18 @@ package main
 import (
 	"fmt"
 
+	"github.com/bhavnavarshney/Algorithms-and-Data-Structures/Go/greedy"
 	"github.com/bhavnavarshney/Algorithms-and-Data-Structures/Go/hashing"
 	"github.com/bhavnavarshney/Algorithms-and-Data-Structures/Go/linkedlist"
 	"github.com/bhavnavarshney/Algorithms-and-Data-Structures/Go/searching"
-	"github.com/bhavnavarshney/Algorithms-and-Data-Structures/Go/strings"
+	"github.com/bhavnavarshney/Algorithms-and-Data-Structures/Go/sorting"
 	"github.com/bhavnavarshney/Algorithms-and-Data-Structures/Go/trees"
 )
 
 func main() {
 	var ch int
 	for {
-		fmt.Println("\n0: Exit 1. SinglyLinkedList 2: DoublyLinkedList 3. HashMap 4. BinarySearchTree 5. KMP 6. Searching")
+		fmt.Println("\n0: Exit 1. SinglyLinkedList 2: DoublyLinkedList 3. HashMap 4. BinarySearchTree 5. Searching 6. Sorting 7. Greedy")
 		fmt.Scanf("%d", &ch)
 		if ch == 0 {
 			return
@@ -31,12 +32,15 @@ func main() {
 		case 4:
 			trees.TestBSTExecution()
 			break
-		case 5:
-			strings.TestKMP()
-			break
 		case 6:
 			searching.TestSearching()
 			break
+		case 7:
+			sorting.TestSorting()
+			break
+		case 8:
+			greedy.Greedy()
+			break
 		}
 	}