Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

ASM1 - Data Structures and Algorithms, Exercises of Creative Thinking

Hong Kong Polytechnic UniversityCreative Thinking

Working as in-house sofware developer for Sofnet Development Ltd, a sofware body-shop providing network provisioning solutons. The company is part of a collaboratve service provisioning development project and the company has won the contract to design and d evelop a middleware soluton that will interface at the front-end to multple computer provisioning interfaces including SOAP, HTTP, JML and CLI, and the back-end telecom provisioning network via CLI.

Typology: Exercises

2024/2025

Uploaded on 12/03/2025

long-nguyen-74
long-nguyen-74 🇭🇰

3 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Page 1 of 5
Lab6 : Sorting in Java (Part 1)
Exercise 1: Implementing Bubble Sort
Objective:
Understand the working of the Bubble Sort algorithm.
Implement Bubble Sort in Java.
Instructions:
1. Create a class named BubbleSort.
2. Write a method bubbleSort(int[] arr) to implement the Bubble Sort
algorithm.
3. Use the array [64, 34, 25, 12, 22, 11, 90] as input.
4. Display the array after each iteration.
5. Count the total number of swaps performed.
Exercise 2: Implementing Insertion Sort
Objective:
Understand the working of the Insertion Sort algorithm.
Implement Insertion Sort in Java.
pf3
pf4
pf5

Partial preview of the text

Download ASM1 - Data Structures and Algorithms and more Exercises Creative Thinking in PDF only on Docsity!

Lab6 : Sorting in Java (Part 1)

Exercise 1: Implementing Bubble Sort

Objective:

 Understand the working of the Bubble Sort algorithm.  Implement Bubble Sort in Java.

Instructions:

  1. Create a class named BubbleSort.
  2. Write a method bubbleSort(int[] arr) to implement the Bubble Sort algorithm.
  3. Use the array [64, 34, 25, 12, 22, 11, 90] as input.
  4. Display the array after each iteration.
  5. Count the total number of swaps performed.

Exercise 2: Implementing Insertion Sort

Objective:

 Understand the working of the Insertion Sort algorithm.  Implement Insertion Sort in Java.

Instructions:

  1. Create a class named InsertionSort.
  2. Write a method insertionSort(int[] arr) to implement the Insertion Sort algorithm.
  3. Use the array [12, 11, 13, 5, 6] as input.
  4. Display the array state after each insertion. Exercise 3: Implementing Selection Sort

Objective:

 Understand how to find the smallest value and place it in the correct position.

Instructions:

  1. Create a class named SelectionSort.
  2. Write a method selectionSort(int[] arr) to implement the Selection Sort algorithm.
  3. Use the array [29, 10, 14, 37, 13].
  4. Display the array state after each swap.

Exercise 5: Checking Stability

Objective:

 Determine the stability of each sorting algorithm.

Instructions:

  1. Use an array of tuples (e.g., (4, 'a'), (2, 'b'), (2, 'c'), (8, 'd')).
  2. Sort the array using Bubble Sort, Insertion Sort, and Selection Sort.
  3. Verify whether the relative order of elements with the same value is preserved. Exercise 6: Real-World Application

Objective:

 Apply sorting algorithms to solve a real-world problem.

Instructions:

  1. Create a list of students: ("Alice", 85), ("Bob", 95), ("Charlie", 75), ("David", 90).
  2. Sort the students by their scores in ascending order using Insertion Sort.
  3. Display the sorted list of students.