findin median
[103 byte] By [gomaa] at [2007-10-1 21:51:38] 
What will be the upper bound to choose middle element, if array of size 'n' is already sorted.
What do you think?
rkippena at 2007-7-13 7:54:53 >
i think it should be O(1) what about it?
gomaa at 2007-7-13 7:54:53 >
Depends if you know how many elements are in the array.
If you know the value of n, then you are correct. If you have to count then it will be O(n). Since most containers generally store a size counter of the number of elements inside, then your answer should be sufficient to please the person who will be marking your assignment.
rkippena at 2007-7-13 7:54:53 >
Actually, if the array size was unknown, you could find the first null index in O(logn) time.
rkippena at 2007-7-13 7:54:53 >
Other Topics New Topic
- Implementation of Generic Connection Framework (jcp-197)
- How to get the arrow keys to work in 2D game?
- String to BitSet Conversion
- JAIN SIP exception - bad message tag missing!
- Porting Java Sources to other languages
- Circle-in-a-square problem with Backpropagation Neural Networks
- how to implement this ?
- Multi-system Emulator (Master System, TurboGrafx and more) in Java
Other Topics Hot Topic
Other Topics
All Classified
- Archived Forums
- Enterprise & Remote Computing
- Java Essentials
- Desktop
- Core
- Solaris Operating System
- Security
- Database Connectivity
- Java Mobility Forums
- Web & Directory Servers
- Development Tools
- Application & Integration Servers
- Java HotSpot Virtual Machine
- Other Topics
- E-Mail, Calendar, & Collaboration
- Developer Tools
- General
- Administration Tools
- Sun Hardware
- Storage Forums
- Java Enterprise System
- StarOffice
- Open Source Technologies
- BigAdmin
- Real-Time
- Java Coding