ith position this wher 0 is converted in to 1
Data Structure Used: Array
Algorithm:(Done Will Post Soon)
Working Code:
Time Complexity O(logn) yes its logn ??
Space Complexity O(1)
Run Here
Monday, July 4, 2011
Given an Sorted Array of 0s and 1s of infinite length fin the position of transition in array
e.g. 0000000....01......11111.....1.. infinite
ith position this wher 0 is converted in to 1
Data Structure Used: Array
Algorithm:(Done Will Post Soon)
Working Code:
Time Complexity O(logn) yes its logn ??
Space Complexity O(1)
Run Here
ith position this wher 0 is converted in to 1
Data Structure Used: Array
Algorithm:(Done Will Post Soon)
Working Code:
Time Complexity O(logn) yes its logn ??
Space Complexity O(1)
Run Here
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment