From 28bb5ab57690202e20c9e9bf3dc3f5f28b99b216 Mon Sep 17 00:00:00 2001
From: devaprasad-n-m <59179637+devaprasad-n-m@users.noreply.github.com>
Date: Tue, 14 Oct 2025 01:27:42 +0530
Subject: [PATCH] adding an example of greedy alogrithm

Activity Selection
---
 ActivitySelection.java | 49 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 49 insertions(+)
 create mode 100644 ActivitySelection.java

diff --git a/ActivitySelection.java b/ActivitySelection.java
new file mode 100644
index 0000000..de70d64
--- /dev/null
+++ b/ActivitySelection.java
@@ -0,0 +1,49 @@
+import java.util.*;
+
+class Activity{
+	int a,b;
+	Activity(int start,int end){
+		a=start;
+		b=end;
+	}
+}
+public class ActivitySelection {
+
+	public static void main(String[] args) {
+		int[] start = {1, 3, 0, 5, 8, 5};
+		int[] end =   {2, 4, 6, 7, 9, 9};
+		
+		System.out.println(solution(start,end));
+
+	}
+
+	private static int solution(int[] start, int[] end) {
+		int n = start.length;
+		int output = 1;
+		
+		List<Activity> activityList = new ArrayList<Activity>();
+		
+		for(int i = 0; i<n;i++) {
+			Activity activity = new Activity(start[i], end[i]);
+			activityList.add(activity);
+		}
+		
+		activityList.sort(Comparator.comparingInt(a->a.b));
+		
+		Activity initial = activityList.get(0);
+		
+		for(int i=1;i<n;i++) {
+			if(initial.a<activityList.get(i).a) {
+				output++;
+				initial = activityList.get(i);
+				
+			}
+				
+				
+		}
+			
+		return output;
+		
+	}
+
+}