Merge branch 'master' into algo/transitiveClosure

Author: Deepak14Jain

DIRECTORY.md

@@ -1302,6 +1302,7 @@
   * [Shell Sort](sorts/shell_sort.py)
   * [Shrink Shell Sort](sorts/shrink_shell_sort.py)
   * [Slowsort](sorts/slowsort.py)
+  * [Stalin Sort](sorts/stalin_sort.py)
   * [Stooge Sort](sorts/stooge_sort.py)
   * [Strand Sort](sorts/strand_sort.py)
   * [Tim Sort](sorts/tim_sort.py)

machine_learning/k_means_clust.py

@@ -37,7 +37,13 @@
             heterogeneity,
             k
         )
-  5. Transfers Dataframe into excel format it must have feature called
+  5. Plot the labeled 3D data points with centroids.
+        plot_kmeans(
+            X,
+            centroids,
+            cluster_assignment
+        )
+  6. Transfers Dataframe into excel format it must have feature called
       'Clust' with k means clustering numbers in it.
 """
 
@@ -126,6 +132,19 @@ def plot_heterogeneity(heterogeneity, k):
     plt.show()
 
 
+def plot_kmeans(data, centroids, cluster_assignment):
+    ax = plt.axes(projection="3d")
+    ax.scatter(data[:, 0], data[:, 1], data[:, 2], c=cluster_assignment, cmap="viridis")
+    ax.scatter(
+        centroids[:, 0], centroids[:, 1], centroids[:, 2], c="red", s=100, marker="x"
+    )
+    ax.set_xlabel("X")
+    ax.set_ylabel("Y")
+    ax.set_zlabel("Z")
+    ax.set_title("3D K-Means Clustering Visualization")
+    plt.show()
+
+
 def kmeans(
     data, k, initial_centroids, maxiter=500, record_heterogeneity=None, verbose=False
 ):
@@ -193,6 +212,7 @@ def kmeans(
         verbose=True,
     )
     plot_heterogeneity(heterogeneity, k)
+    plot_kmeans(dataset["data"], centroids, cluster_assignment)
 
 
 def report_generator(

sorts/stalin_sort.py

@@ -0,0 +1,47 @@
+"""
+Stalin Sort algorithm: Removes elements that are out of order.
+Elements that are not greater than or equal to the previous element are discarded.
+Reference: https://medium.com/@kaweendra/the-ultimate-sorting-algorithm-6513d6968420
+"""
+
+
+def stalin_sort(sequence: list[int]) -> list[int]:
+    """
+    Sorts a list using the Stalin sort algorithm.
+
+    >>> stalin_sort([4, 3, 5, 2, 1, 7])
+    [4, 5, 7]
+
+    >>> stalin_sort([1, 2, 3, 4])
+    [1, 2, 3, 4]
+
+    >>> stalin_sort([4, 5, 5, 2, 3])
+    [4, 5, 5]
+
+    >>> stalin_sort([6, 11, 12, 4, 1, 5])
+    [6, 11, 12]
+
+    >>> stalin_sort([5, 0, 4, 3])
+    [5]
+
+    >>> stalin_sort([5, 4, 3, 2, 1])
+    [5]
+
+    >>> stalin_sort([1, 2, 3, 4, 5])
+    [1, 2, 3, 4, 5]
+
+    >>> stalin_sort([1, 2, 8, 7, 6])
+    [1, 2, 8]
+    """
+    result = [sequence[0]]
+    for element in sequence[1:]:
+        if element >= result[-1]:
+            result.append(element)
+
+    return result
+
+
+if __name__ == "__main__":
+    import doctest
+
+    doctest.testmod()