Question

For each of the following two sorting algorithms, describe its operation in detail, using diagrams, Java code, and/or pseudocode as you feel are appropriate As part of your answer, for each one, demonstrate how it operates by showing all passes over the following array of integers: [3, 7,1, 11,5,2,8,4,9 (i) Shell Sort

Answer 1

Please Upvote if you find this useful.
ohile p: so): tempy erne ← end h endohie gop temp r So no temp So mo chonse tem temf

so no thang tem ao- emt 2| 3| |9 | 커리 1119 nLo 5 ュ3 temp temp 皿emp 2. 2 七

3 5 6 구? DI lisly1지.FItt a n(1-1 JǐeantoJe hemp go no charge. tem gono hangu temp le aus e tJ-ten onochn , So mp conditisn Anoy Sected