Rename package

Author: bcExpt1123

CONTRIBUTING.md

@@ -8,7 +8,7 @@ Thank you for taking the time to contribute to this project! Here are a few guid
 
 2. **Clone the repository**: Clone your forked repository to your local machine using the following command:
     ```sh
-    git clone https://github.com/your-username/java-alda.git
+    git clone https://github.com/your-username/java-dsa.git
     ```
 
 3. **Create a branch**: Create a new branch for your work using the following command:

README.md

@@ -1,4 +1,4 @@
-# Java Algorithms and Data Structures
+# Java Data Structures and Algorithms
 
 This repository contains implementations of various algorithms and data structures in Java. It is intended as a resource for learning and reference.
 
@@ -94,11 +94,11 @@ Implementation and usage of graphs.
 
 1. Clone the repository:
     ```sh
-    git clone https://github.com/bcExpt1123/java-alda.git
+    git clone https://github.com/bcExpt1123/java-dsa.git
     ```
 2. Navigate to the project directory:
     ```sh
-    cd java-alda
+    cd java-dsa
     ```
 
 ## Usage
@@ -107,10 +107,12 @@ Run code:
 ```sh
   mvn clean compile exec:java
 ```
+
 Run test:
 ```sh
   mvn test
 ```
+
 Run Check style:
 ```sh
   mvn checkstyle:check

pom.xml

@@ -12,7 +12,7 @@
         <maven.compiler.source>23</maven.compiler.source>
         <maven.compiler.target>23</maven.compiler.target>
         <project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
-        <exec.mainClass>org.alda.Main</exec.mainClass>
+        <exec.mainClass>org.dsa.Main</exec.mainClass>
     </properties>
     <dependencies>
         <dependency>

src/main/java/org/alda/Main.java renamed to src/main/java/org/dsa/Main.java

@@ -1,26 +1,26 @@
-package org.alda;
-
-import org.alda.structure.linkedList.circular.CircularLinkedList;
-import org.alda.structure.linkedList.deque.DoublyEndedList;
-import org.alda.structure.linkedList.deque.IDoublyEndedList;
-import org.alda.structure.linkedList.doubly.DoublyLinkedList;
-import org.alda.structure.linkedList.simple.ISimpleLinkedList;
-import org.alda.structure.linkedList.simple.Node;
-import org.alda.structure.linkedList.simple.SimpleLinkedList;
-import org.alda.structure.linkedList.sorted.ISortedLinkedList;
-import org.alda.structure.linkedList.sorted.SortedLinkedList;
-import org.alda.structure.queue.IQueue;
-import org.alda.structure.queue.Queue;
-import org.alda.structure.queue.array.QueueArray;
-import org.alda.structure.queue.linkedList.QueueLinkedList;
-import org.alda.structure.queue.priority.IPriorityQueue;
-import org.alda.structure.queue.priority.PriorityQueue;
-import org.alda.structure.stack.array.IStackArray;
-import org.alda.structure.stack.array.StackArray;
-import org.alda.structure.stack.linkedList.IStackLinkedList;
-import org.alda.structure.stack.linkedList.StackLinkedList;
-import org.alda.structure.tree.bst.BinarySearchTree;
-import org.alda.structure.tree.bst.bbt.AVLTest;
+package org.dsa;
+
+import org.dsa.structure.linkedList.circular.CircularLinkedList;
+import org.dsa.structure.linkedList.deque.DoublyEndedList;
+import org.dsa.structure.linkedList.deque.IDoublyEndedList;
+import org.dsa.structure.linkedList.doubly.DoublyLinkedList;
+import org.dsa.structure.linkedList.simple.ISimpleLinkedList;
+import org.dsa.structure.linkedList.simple.Node;
+import org.dsa.structure.linkedList.simple.SimpleLinkedList;
+import org.dsa.structure.linkedList.sorted.ISortedLinkedList;
+import org.dsa.structure.linkedList.sorted.SortedLinkedList;
+import org.dsa.structure.queue.IQueue;
+import org.dsa.structure.queue.Queue;
+import org.dsa.structure.queue.array.QueueArray;
+import org.dsa.structure.queue.linkedList.QueueLinkedList;
+import org.dsa.structure.queue.priority.IPriorityQueue;
+import org.dsa.structure.queue.priority.PriorityQueue;
+import org.dsa.structure.stack.array.IStackArray;
+import org.dsa.structure.stack.array.StackArray;
+import org.dsa.structure.stack.linkedList.IStackLinkedList;
+import org.dsa.structure.stack.linkedList.StackLinkedList;
+import org.dsa.structure.tree.bst.BinarySearchTree;
+import org.dsa.structure.tree.bst.bbt.AVLTest;
 
 import java.util.Scanner;
 
@@ -501,7 +501,7 @@ public static void testBST(){
         System.out.println("- Inorder Traversal ");
         System.out.println(bst.inorderTraversal());
         System.out.print("\nSearch for 4: ");
-        org.alda.structure.tree.bst.Node<Integer> node = bst.search(4);
+        org.dsa.structure.tree.bst.Node<Integer> node = bst.search(4);
         if (node != null) System.out.println("true");
         else System.out.println("false");
     }

src/main/java/org/alda/common/Comparer.java renamed to src/main/java/org/dsa/common/Comparer.java

@@ -1,4 +1,4 @@
-package org.alda.common;
+package org.dsa.common;
 
 /**
  * @author bcExpt1123

src/main/java/org/alda/common/Printable.java renamed to src/main/java/org/dsa/common/Printable.java

@@ -1,4 +1,4 @@
-package org.alda.common;
+package org.dsa.common;
 
 /**
  * @author bcExpt1123

src/main/java/org/alda/common/Utils.java renamed to src/main/java/org/dsa/common/Utils.java

@@ -1,4 +1,4 @@
-package org.alda.common;
+package org.dsa.common;
 
 import java.util.Arrays;
 

src/main/java/org/alda/sample/stack/BalancedParenthesesCheck.java renamed to src/main/java/org/dsa/sample/stack/BalancedParenthesesCheck.java

@@ -1,4 +1,4 @@
-package org.alda.sample.stack;
+package org.dsa.sample.stack;
 
 import java.util.ArrayList;
 import java.util.HashMap;

src/main/java/org/alda/structure/linkedList/circular/CircularLinkedList.java renamed to src/main/java/org/dsa/structure/linkedList/circular/CircularLinkedList.java

@@ -1,6 +1,6 @@
-package org.alda.structure.linkedList.circular;
+package org.dsa.structure.linkedList.circular;
 
-import org.alda.common.Printable;
+import org.dsa.common.Printable;
 
 /**
  * @author bcExpt1123

src/main/java/org/alda/structure/linkedList/circular/Node.java renamed to src/main/java/org/dsa/structure/linkedList/circular/Node.java

@@ -1,6 +1,6 @@
-package org.alda.structure.linkedList.circular;
+package org.dsa.structure.linkedList.circular;
 
-import org.alda.common.Printable;
+import org.dsa.common.Printable;
 
 /**
  * @author bcExpt1123