Scribd
Upload
3 views1 page

Sorting Task

The document outlines an asynchronous task focused on understanding basic sorting algorithms, specifically Bubble Sort, Selection Sort, and Insertion Sort, using a sample array. It includes instructions for manual tracing of each algorithm, analysis questions regarding their efficiency and understanding, and submission requirements for Java source code and documentation. The task emphasizes both theoretical understanding and practical implementation in Java.

Uploaded by

aldrichdelapena44
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Sorting Task

The document outlines an asynchronous task focused on understanding basic sorting algorithms, specifically Bubble Sort, Selection Sort, and Insertion Sort, using a sample array. It includes instructions for manual tracing of each algorithm, analysis questions regarding their efficiency and understanding, and submission requirements for Java source code and documentation. The task emphasizes both theoretical understanding and practical implementation in Java.

Uploaded by

aldrichdelapena44
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Data Structures and Algorithms

Asynchronous Task

Apply and understand the basic sorting algorithms: • Uses this sample array:
• Bubble Sort int[] arr = {29, 10, 14, 37, 13};
• Selection Sort • Displays:
• Insertion Sort o Original array
o Sorted array
Part 1: Manual Tracing
Bonus (Optional +5 pts):
Given Array:
• Display the array after each pass/iteration
29, 10, 14, 37, 13
Instructions: Part 3: Analysis
Perform step-by-step sorting for: 1. Which sorting algorithm was easiest to
1. Bubble Sort understand? Why?
• Show each pass 2. Which algorithm do you think is more efficient?
• Indicate swaps Why?
2. Selection Sort 3. What is the main difference between the three
• Show each pass algorithms?
• Indicate selected minimum Submission Requirements
3. Insertion Sort 1. Java Source Code ([Link])
• Show each insertion step
2. Documentation ([Link])
• Show shifting of elements
• Manual Solution = Step-by-step tracing (photo or
You may present your answer in table format or step
typed)
format.
• Output Screenshot = Showing program result
Part 2: Java Implementation (Coding) • Short Analysis Answer
Create a Java program that:
• Implements at least TWO of the following:
o Bubble Sort
o Selection Sort
o Insertion Sort

You might also like