Assume that you have a student list of this class which list consists of only student names. Your task is sorting the given list by dictionary order, sorting operation must be realized using the bubble sort algorithm. Additionally, this list implementation should be written using a two-dimensional char ar- ray. Bubble Sort Algorithm 1 function swap(a, b) 2 3 end function // Fill own your own! 4 5 function compare (a, b) // Compare function should be implemented to realize the sorting criteria. // For example, elements in a are strings and 7 8 // they are to be sorted in dictionary order. // stremp function can be used in place of compare function. 10 11 12 end function 13 14 function bubble.sort (a, n) while n != 0 15 high = 0 for i=0 to n–2 incremented by 1 if compare (a[ i], a[i+1]) > 0 then swap (a[ i], a[i+1]) high = i+1 end if 16 17 18 19 20 21 22 end for n = high end while 23 24 25 end function
Assume that you have a student list of this class which list consists of only student names. Your task is sorting the given list by dictionary order, sorting operation must be realized using the bubble sort algorithm. Additionally, this list implementation should be written using a two-dimensional char ar- ray. Bubble Sort Algorithm 1 function swap(a, b) 2 3 end function // Fill own your own! 4 5 function compare (a, b) // Compare function should be implemented to realize the sorting criteria. // For example, elements in a are strings and 7 8 // they are to be sorted in dictionary order. // stremp function can be used in place of compare function. 10 11 12 end function 13 14 function bubble.sort (a, n) while n != 0 15 high = 0 for i=0 to n–2 incremented by 1 if compare (a[ i], a[i+1]) > 0 then swap (a[ i], a[i+1]) high = i+1 end if 16 17 18 19 20 21 22 end for n = high end while 23 24 25 end function
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
in c
![Lab Work
Assume that you have a student list of this class which list consists of only
student names. Your task is sorting the given list by dictionary order, sorting
operation must be realized using the bubble sort algorithm. Additionally,
this list implementation should be written using a two-dimensional char ar-
ray.
Bubble Sort Algorithm
1 function swap(a, b)
2
// Fill own your own!
3 end function
4
5 function compare (a, b)
// Compare function should be implemented
7
to realize the sorting criteria.
// For example, elements in a are strings and
//
// stremp function can be used in place
//
8
they are to be sorted in dictionary order.
10
11
of compare function.
12 end function
13
14 function bubble-sort (a, n)
while n != 0
15
16
high = 0
for i=0 to n-2 incremented by 1
if compare (a[i], a[i+1]) > 0 then
swap (a [ i], a[i+1])
high = i+1
17
18
19
20
21
end if
22
end for
n = high
end while
23
24
25 end function](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4948eeeb-4baf-43e2-8b74-00c4b3843a16%2F58be6ff7-93ab-46db-881e-7eaf469b56d0%2Fy3p57b_processed.png&w=3840&q=75)
Transcribed Image Text:Lab Work
Assume that you have a student list of this class which list consists of only
student names. Your task is sorting the given list by dictionary order, sorting
operation must be realized using the bubble sort algorithm. Additionally,
this list implementation should be written using a two-dimensional char ar-
ray.
Bubble Sort Algorithm
1 function swap(a, b)
2
// Fill own your own!
3 end function
4
5 function compare (a, b)
// Compare function should be implemented
7
to realize the sorting criteria.
// For example, elements in a are strings and
//
// stremp function can be used in place
//
8
they are to be sorted in dictionary order.
10
11
of compare function.
12 end function
13
14 function bubble-sort (a, n)
while n != 0
15
16
high = 0
for i=0 to n-2 incremented by 1
if compare (a[i], a[i+1]) > 0 then
swap (a [ i], a[i+1])
high = i+1
17
18
19
20
21
end if
22
end for
n = high
end while
23
24
25 end function
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY