Artemis: Refactor Methods for Efficiency and Code Clarity

[artemis-gen-ai]

This pull request includes several refactorings aimed at improving the efficiency and clarity of various methods across multiple classes. Key changes include:

1. Single Class Refactor:

   • Optimized sumRange, maxArray, and sumModulus methods by removing unnecessary data structures and improving loop efficiency, leading to reduced memory usage and enhanced performance.

2. DsLinkedList Class Shuffle Method:

   • Refactored the shuffle method to implement the Fisher-Yates shuffle algorithm, improving randomness and efficiency by eliminating the need for temporary lists and using a more concise approach with the Random class.

3. Sort Class MaxN Method:

   • Updated the MaxN method to utilize a PriorityQueue for dynamically maintaining the largest n elements, significantly reducing time complexity and improving performance compared to the previous sorting method.

4. DoubleTest Class Formatting:

   • Made a cosmetic change to the formatting of the closing brace in the DoubleTest class for consistency, without affecting functionality.

These changes collectively enhance code performance, maintainability, and adherence to best practices.

Metric	Improvement	Value
runtime	🟢 8.23%	0.75 s
cpu	🟢 3.46%	135.41 %
memory	🟢 31.37%	49.77 MB