Merge pull request #261 from Anujmishra2005/main

merge_sort.py added

Author: Pradeepsingh61

Python/algorithms/graph_algorithms/prism_algorithm.py

@@ -0,0 +1,62 @@
+def prism(data, target):
+    rules = []
+    classes = set(row[target] for row in data)
+
+    for cls in classes:
+        cls_data = [row for row in data if row[target] == cls]
+        uncovered = cls_data.copy()
+
+        while uncovered:
+            rule = {}
+            remaining_features = list(data[0].keys())
+            remaining_features.remove(target)
+
+            while True:
+                best_feature, best_value, best_coverage = None, None, 0
+
+                for feature in remaining_features:
+                    values = set(row[feature] for row in uncovered)
+                    for value in values:
+                        coverage = [row for row in uncovered if row[feature] == value]
+                        if len(coverage) > best_coverage:
+                            best_coverage = len(coverage)
+                            best_feature = feature
+                            best_value = value
+
+                if best_feature is None:
+                    break
+
+                rule[best_feature] = best_value
+                uncovered = [row for row in uncovered if row[best_feature] == best_value]
+
+                if all(row[target] == cls for row in uncovered):
+                    rules.append((rule.copy(), cls))
+                    uncovered = [row for row in cls_data if not rule_matches(rule, row)]
+                    break
+
+                remaining_features.remove(best_feature)
+
+    return rules
+
+def rule_matches(rule, row):
+    for feature, value in rule.items():
+        if row[feature] != value:
+            return False
+    return True
+
+if __name__ == "__main__":
+    n = int(input("Enter number of rows: "))
+    features = input("Enter feature names separated by space (last one is target): ").split()
+    data = []
+
+    for _ in range(n):
+        values = input(f"Enter values for {features} separated by space: ").split()
+        row = {features[i]: values[i] for i in range(len(features))}
+        data.append(row)
+
+    target = features[-1]
+    rules = prism(data, target)
+
+    print("\nGenerated Rules:")
+    for r, cls in rules:
+        print(f"If {r} then {target} = {cls}")

Python/algorithms/sorting/merge_sort.py

@@ -0,0 +1,26 @@
+def merge_sort(arr):
+    if len(arr) <= 1:
+        return arr
+    mid = len(arr) // 2
+    left_half = merge_sort(arr[:mid])
+    right_half = merge_sort(arr[mid:])
+    return merge(left_half, right_half)
+
+def merge(left, right):
+    merged = []
+    i = j = 0
+    while i < len(left) and j < len(right):
+        if left[i] <= right[j]:
+            merged.append(left[i])
+            i += 1
+        else:
+            merged.append(right[j])
+            j += 1
+    merged.extend(left[i:])
+    merged.extend(right[j:])
+    return merged
+
+if __name__ == "__main__":
+    arr = list(map(int, input("Enter numbers separated by space: ").split()))
+    sorted_arr = merge_sort(arr)
+    print("Sorted array:", sorted_arr)