Scribd
Upload
59 views1 page

ES 102 - Introduction To Computing Lab Assignment - 5: October 9, 2015

This lab assignment asks students to design algorithms for common sorting methods like selection sort and bubble sort, as well as algorithms to merge sorted lists, including merging two sorted lists into one and merging three sorted lists into a single sorted list while removing duplicate elements during a modified selection sort.

Uploaded by

Shyam Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
59 views1 page

ES 102 - Introduction To Computing Lab Assignment - 5: October 9, 2015

This lab assignment asks students to design algorithms for common sorting methods like selection sort and bubble sort, as well as algorithms to merge sorted lists, including merging two sorted lists into one and merging three sorted lists into a single sorted list while removing duplicate elements during a modified selection sort.

Uploaded by

Shyam Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 1

ES 102 - Introduction to Computing

Lab Assignment - 5

October 9, 2015

1. Design algorithms to implement selection sort, bubble sort, insertion


sort on a given unsorted list.
2. Design an algorithm to merge 2 sorted lists using only 2 lists. Assume
that the size of the sorted lists are known.
3. Design a modified selection sort algorithm which automatically removes duplicates during the sorting process.
4. Design an algorithm to merge 3 sorted lists into a sorted list.

You might also like