Merge pull request #112 from deepesh611/main

Updated Greeting Workflows

.github/workflows/issue-welcome-comment.yml

@@ -12,12 +12,17 @@ jobs:
         uses: actions/github-script@v6
         with:
           script: |
-            github.issues.createComment({
-              issue_number: context.payload.issue.number,
-              owner: context.repo.owner,
-              repo: context.repo.repo,
-              body: `Thank you for creating an issue! 🎉 Please make sure to:
-              - Read our [CONTRIBUTING.md](https://github.com/${context.repo.owner}/${context.repo.repo}/blob/main/CONTRIBUTING.md) guide.
-              - Star our repo ⭐ if you find it useful.
-              Your contribution is appreciated!`
-            })
+            const issue_number = context.issue.number;
+            const owner = context.repo.owner;
+            const repo = context.repo.repo;
+            const body = `Thank you for creating an issue! 🎉 Please make sure to:
+            - Read our [CONTRIBUTING.md](https://github.com/${owner}/${repo}/blob/main/CONTRIBUTING.md) guide.
+            - Star our repo ⭐ if you find it useful.
+            Your contribution is appreciated!`;
+
+            github.rest.issues.createComment({
+              issue_number: issue_number,
+              owner: owner,
+              repo: repo,
+              body: body
+            });

.github/workflows/pr-thank-you.yml

@@ -9,25 +9,35 @@ jobs:
     runs-on: ubuntu-latest
     steps:
       - name: Send Welcome Comment
-        if: github.event.action == 'opened'
+        if: ${{ github.event.action == 'opened' }}
         uses: actions/github-script@v6
         with:
           script: |
-            github.issues.createComment({
-              issue_number: context.payload.pull_request.number,
-              owner: context.repo.owner,
-              repo: context.repo.repo,
-              body: 'Thank you for your contribution! 🎉 We appreciate your effort in making our project better. Please provide any additional information if needed.'
-            })
+            const issue_number = context.payload.pull_request.number;
+            const owner = context.repo.owner;
+            const repo = context.repo.repo;
+            const body = 'Thank you for your contribution! 🎉 We appreciate your effort in making our project better. Please provide any additional information if needed.';
+
+            github.rest.issues.createComment({
+              issue_number: issue_number,
+              owner: owner,
+              repo: repo,
+              body: body
+            });
 
       - name: Send Merge Comment
-        if: github.event.action == 'closed' && github.event.pull_request.merged == true
+        if: ${{ github.event.action == 'closed' && github.event.pull_request.merged == true }}
         uses: actions/github-script@v6
         with:
           script: |
-            github.issues.createComment({
-              issue_number: context.payload.pull_request.number,
-              owner: context.repo.owner,
-              repo: context.repo.repo,
-              body: 'Thank you for merging this PR! 🙌 Your contribution has been successfully integrated into the project. Great job!'
-            })
+            const issue_number = context.payload.pull_request.number;
+            const owner = context.repo.owner;
+            const repo = context.repo.repo;
+            const body = '🎉 Congrats, your changes were accepted !!! 🙌 Your contribution has been successfully integrated into the project. Great job!';
+
+            github.rest.issues.createComment({
+              issue_number: issue_number,
+              owner: owner,
+              repo: repo,
+              body: body
+            });

README.md

@@ -1,4 +1,4 @@
-# #Visual Sort
+# #Visual Sort 
 
 Welcome to **Visual Sort**, a web-based sorting algorithm visualization tool built using HTML, CSS, Bootstrap, SCSS, and JavaScript. This project provides an interactive way to visualize various sorting algorithms in action, helping users understand how different algorithms work and their efficiency in sorting data.