View more random threads:
- MGMT 611 Humane Relations GDB No.1 Solution Spring Semester...
- Mkt501 GDB No. 2 solution June 2011
- MGT501 Human Resource Management GDB No.1 Discussions and...
- MGT211 Introduction To Business GDB no 1 fall Spring 2...
- MGMT611 Human Relations GDB No.2 Solution Fall Semester 2013
- Mkt630 GDB idea solution No. 2 spring 2011
- GDB motivation for hrmMGTm611 solution 25/01/2011
- IT430 GDB fall 2010 on 31/01/2011 Solved by Xpert vuhelp
- mgt101 Financial Accounting GDB idea solution spring June...
- HRM624 Conflict Management - GDB 1 Spring 2011 Idea...
CS301 Data Structures GDB No.1 Solution Fall Semester 2013
Total Marks 5
Starting Date Tuesday, January 22, 2013
Closing Date Thursday, January 24, 2013
Status Open
Question/Description
GDB’s Instructions
You need to provide precise and to the point answer, avoid irrelevant details.
Try to justify your answer mathematically.
Copy from the internet will get zero marks.
GDB’s Topic
The better algorithm for sorting a set of data has O(nlogn) running time, linear search has O(n) running time and binary search has O(logn) running time, where big O is a notation for expressing running time of algorithms you may treat these running times like n, nlogn, logn.
Sponsored Links
On the basis of this information, consider the scenario that there is a large set of unsorted data, you need to perform “n” searches on this data. For this you have the following two options.
Perform “n” linear searches
First sort this data in O(nlogn) time and then perform “n” binary searches.
Which option will you choose? Justify your answer mathematically.
There are currently 1 users browsing this thread. (0 members and 1 guests)