// CPCS 324 Algorithms & Data Structures 2 // Selection Sort Decision Study // 2020, Dr. Muhammad Al-Hashimi // Exercise: generate a decision tree for lists of length n=4. Note tree height, // compare to #comps expected for selection sort. // input positions (name 1st a, 2nd b, etc.) var p = ["a","b","c"]; // sorted position permutations (assign values to force position) // same order as textbook left-to-right var a = [ [1,2,3], // a${a[i]}
`); selsort(a[i]); // document.write(`post ${a[i]}
`); } // -------------------- // selection sort (Levitin, 3rd ed) // track pseudocode decisions, note position comp direction // still a valid decision tree but different // input list permutations in any order will also work function selsort(a) { var d, n = a.length; for (var i=0; i