Home
Search
Register
Log inGiven a sorted array find all possible |ai - aj| where ai,aj belongs to Array A. n^2 is obvious. Find a solution in O(N).
3 posters
Page 1 of 1
Given a sorted array find all possible |ai - aj| where ai,aj belongs to Array A. n^2 is obvious. Find a solution in O(N).
skyboard Sat Sep 03, 2011 4:55 pm
No answer yet
skyboard- Posts : 31
Join date : 2011-09-03
Re: Given a sorted array find all possible |ai - aj| where ai,aj belongs to Array A. n^2 is obvious. Find a solution in O(N).
viterbi Tue Sep 13, 2011 9:53 am
I think this problem for quite a while, and I don't think it's possible. Are you sure about the problem? Where did you see this problem?
viterbi- Posts : 32
Join date : 2011-09-03
Re: Given a sorted array find all possible |ai - aj| where ai,aj belongs to Array A. n^2 is obvious. Find a solution in O(N).
Admin Tue Sep 13, 2011 11:11 am
I saw this problem in MITBBS, also not sure about the time complexity it requires.
viterbi wrote:I think this problem for quite a while, and I don't think it's possible. Are you sure about the problem? Where did you see this problem?
Admin- Admin
- Posts : 131
Join date : 2011-08-16 -
Re: Given a sorted array find all possible |ai - aj| where ai,aj belongs to Array A. n^2 is obvious. Find a solution in O(N).
Sponsored content
Sponsored content
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum|
|
|