How can you sort an array without using built-in methods in Java?

• A. Using recursion
• B. Using nested loops with comparison logic
• C. Using sorting classes
• D. Using lambda expressions

Answer: (B)

Sorting an array without using built-in methods can effectively be accomplished by utilizing nested loops with comparison logic. This approach involves implementing a sorting algorithm, such as Bubble Sort or Selection Sort, where the array is iterated through multiple times, and elements are compared to arrange them in the desired order.

In the nested loops approach, the outer loop traverses the entire array, and for each element, the inner loop compares it to the other elements. Depending on the chosen sorting method, elements can be swapped based on the comparison results. For example, in Bubble Sort, adjacent elements are compared, and if they are out of order, they are swapped, effectively "bubbling" the largest unsorted element to its correct position with each iteration of the outer loop.

Other options provided do not align with the criteria of sorting an array without using built-in methods. Recursion (the first choice) can be a technique for implementing certain sorting algorithms, but it does not directly relate to the basic concept of sorting without built-ins as it doesn't encapsulate the idea of comparing elements in a straightforward manner. Sorting classes (the third choice) inherently rely on built-in methods provided by the Java language to perform their function, thus contradicting the requirement of not using built