Added insertion sort algorithm in Javascript

[Paila-Sahitya]

🧩 Insertion Sort Algorithm in JavaScript

📘 Description

This PR adds an implementation of Insertion Sort algorithm in JavaScript.
Insertion Sort builds the sorted array one element at a time by inserting each element into its correct position among the already sorted elements.

✨ Features

• Clean and well-commented code
• In-place sorting (O(1) space complexity)
• Includes detailed test cases for validation:
  • Regular unsorted array
  • Already sorted array
  • Reverse sorted array
  • Array with duplicates
  • Single element array
  • Empty array

⏱️ Complexity

• Time Complexity:
  • Best Case: O(n)
  • Average Case: O(n²)
  • Worst Case: O(n²)
• Space Complexity: O(1)

💻 Language

JavaScript

[github-actions]

🎉 Welcome to Hacktoberfest 2025, @Paila-Sahitya! 🎃

Thank you for your first contribution to our DSA repository! Here's what happens next:

🔍 Automatic Checks

• ✅ Code Validation: Passed
• 🧪 Compilation Tests: Passed

📋 Next Steps

🎯 Great job! Your code compiled successfully. Maintainers @Karanjot786 and @Pradeepsingh61 will review your PR soon.

🎁 What You Get

• 🏆 Hacktoberfest Credit: This PR counts toward your 6 PR goal for exclusive T-shirt + Tree!
• 🌟 Hall of Fame: You'll be featured in our contributors list
• 📚 Learning: Code review feedback from experienced developers

💡 Tips for Success

• Follow our Contributing Guidelines
• Add comments explaining your algorithm
• Include time/space complexity analysis
• Test your code before submitting

Welcome to the community! 🚀

[github-actions]

🤖 Automated PR Status

🔍 Code Validation

✅ Passed - File naming and structure look good!

🧪 Compilation Tests

✅ Passed - All code compiles successfully!

📋 Overall Status

🎉 Ready for Review - Your PR has passed all automated checks!
👥 Maintainers have been notified for review.

---

This comment was generated automatically. Checks will re-run when you push new commits.