algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-12-19 07:00:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Enhance docs, add tests in QuickSortLinkedList (#5998)

Browse Source
This commit is contained in:
Hardik Pawar
2024-10-25 19:50:59 +05:30
committed by GitHub
parent 5246f63579
commit 6f489e5704
2 changed files with 76 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

66
src/test/java/com/thealgorithms/datastructures/lists/QuickSortLinkedListTest.java
View File

@@ -4,8 +4,9 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertNull;
import org.junit.jupiter.api.Test;
/**
* Test cases for QuickSortLinkedList
* Test cases for QuickSortLinkedList.
* Author: Prabhat-Kumar-42
* GitHub: https://github.com/Prabhat-Kumar-42
*/
@@ -16,9 +17,8 @@ public class QuickSortLinkedListTest {
SinglyLinkedList emptyList = new SinglyLinkedList();
QuickSortLinkedList sorter = new QuickSortLinkedList(emptyList);
// Test case: Sorting an empty list should result in an empty list
sorter.sortList();
assertNull(emptyList.getHead());
assertNull(emptyList.getHead(), "Sorted empty list should have no elements.");
}
@Test
@@ -27,10 +27,51 @@ public class QuickSortLinkedListTest {
singleNodeList.insert(5);
QuickSortLinkedList sorter = new QuickSortLinkedList(singleNodeList);
// Test case: Sorting a list with a single node should result in the same list
sorter.sortList();
assertEquals(5, singleNodeList.getHead().value);
assertNull(singleNodeList.getHead().next);
assertEquals(5, singleNodeList.getHead().value, "Single node list should remain unchanged after sorting.");
assertNull(singleNodeList.getHead().next, "Single node should not have a next node.");
}
@Test
public void testSortAlreadySorted() {
SinglyLinkedList sortedList = new SinglyLinkedList();
sortedList.insert(1);
sortedList.insert(2);
sortedList.insert(3);
sortedList.insert(4);
sortedList.insert(5);
QuickSortLinkedList sorter = new QuickSortLinkedList(sortedList);
sorter.sortList();
assertEquals("1->2->3->4->5", sortedList.toString(), "Already sorted list should remain unchanged.");
}
@Test
public void testSortReverseOrderedList() {
SinglyLinkedList reverseList = new SinglyLinkedList();
reverseList.insert(5);
reverseList.insert(4);
reverseList.insert(3);
reverseList.insert(2);
reverseList.insert(1);
QuickSortLinkedList sorter = new QuickSortLinkedList(reverseList);
sorter.sortList();
assertEquals("1->2->3->4->5", reverseList.toString(), "Reverse ordered list should be sorted in ascending order.");
}
@Test
public void testSortWithDuplicates() {
SinglyLinkedList listWithDuplicates = new SinglyLinkedList();
listWithDuplicates.insert(3);
listWithDuplicates.insert(1);
listWithDuplicates.insert(3);
listWithDuplicates.insert(2);
listWithDuplicates.insert(2);
QuickSortLinkedList sorter = new QuickSortLinkedList(listWithDuplicates);
sorter.sortList();
assertEquals("1->2->2->3->3", listWithDuplicates.toString(), "List with duplicates should be sorted correctly.");
}
@Test
@@ -48,18 +89,7 @@ public class QuickSortLinkedListTest {
list.insert(6);
QuickSortLinkedList sorter = new QuickSortLinkedList(list);
// Test case: Sorting a list with multiple elements
sorter.sortList();
assertEquals(1, list.getHead().value);
assertEquals(2, list.getHead().next.value);
assertEquals(3, list.getHead().next.next.value);
assertEquals(4, list.getHead().next.next.next.value);
assertEquals(5, list.getHead().next.next.next.next.value);
assertEquals(6, list.getHead().next.next.next.next.next.value);
assertEquals(7, list.getHead().next.next.next.next.next.next.value);
assertEquals(8, list.getHead().next.next.next.next.next.next.next.value);
assertEquals(9, list.getHead().next.next.next.next.next.next.next.next.value);
assertEquals(10, list.getHead().next.next.next.next.next.next.next.next.next.value);
assertNull(list.getHead().next.next.next.next.next.next.next.next.next.next);
assertEquals("1->2->3->4->5->6->7->8->9->10", list.toString(), "List should be sorted in ascending order.");
}
}