Answer Posted / Sandeep Anannd
In Java, the following collections can maintain their elements in sorted order:n
1. TreeMap: A Red-Black tree implementation of the SortedMap interface.n
2. LinkedHashMap (when sorted by insertion order): Provides access to elements in the order they were inserted into the map.n
3. TimSort: The default sorting algorithm used for ArrayList and Vector, which is a hybrid sorting algorithm combining Mergesort and Insertionsort.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What sort of serious problems have you experienced, and how have you handled them?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Write a program for Sorting an Array. Which sorting will you prefer?
Can you declare an array without assigning the size of an array?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
