So I have created an array of 100 names for the \"project requirments\". I need
ID: 3867993 • Letter: S
Question
So I have created an array of 100 names for the "project requirments". I need to find the required fields in the table.
Observed
Best Case
Data Order
# of Swaps
# of Compares
Data Order
(if there is one)
# of Swaps
# of Compares
Pairwise
From project requirements
Listwise
From project requirements
Merge
From project requirements
Quick
From project requirements
Average Case (Your analysis)
Big O (time) [Worst case]
Big O (space)
# of swaps
# of compares
Data Order
(if there is one)
# of Swaps
# of Compares
Identify, under worst case conditions, how much memory (# of structures) is required
Pairwise
Listwise
Merge
Quick
Observed
Best Case
Data Order
# of Swaps
# of Compares
Data Order
(if there is one)
# of Swaps
# of Compares
Pairwise
From project requirements
Listwise
From project requirements
Merge
From project requirements
Quick
From project requirements
Explanation / Answer
Hi,
Below is the data as per requirements:
I have tested for each sort for all possible scenarios.for average case analysis, i have taken approximate data from several results.For observed section , i did not get the requirement. For other section output is listed in the table:
Observed
Best Case
Data Order
# of Swaps
# of Compares
Data Order
(if there is one)
# of Swaps
# of Compares
Pairwise
From project requirements
elements already sorted
0
9801
Listwise
From project requirements
elements already sorted
50
4950
Merge
From project requirements
elements already sorted
356
356
Quick
From project requirements
elements already sorted
63
4680
Average Case (Your analysis)
Big O (time) [Worst case]
Big O (space)
# of swaps
# of compares
Data Order
(if there is one)
# of Swaps
# of Compares
Identify, under worst case conditions, how much memory (# of structures) is required
Pairwise
2450
9801
elements in reverse order
4950
98501
one array,two variables to compare
Listwise
99
4950
elements in reverse order
99
4950
one array or list,two pointers
Merge
620
550
elements in reverse order
356
356
127 arrays
Quick
190
450
elements in reverse order
112
386
one array , two pointers
Observed
Best Case
Data Order
# of Swaps
# of Compares
Data Order
(if there is one)
# of Swaps
# of Compares
Pairwise
From project requirements
elements already sorted
0
9801
Listwise
From project requirements
elements already sorted
50
4950
Merge
From project requirements
elements already sorted
356
356
Quick
From project requirements
elements already sorted
63
4680
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.