Count operation in direct addressing method should be o(1)
-1
Below is the code for find operation that I code for finding out the repeated values in direct addressing method. But the problem is that I have to design my code in such a way that time complexity will always be O(1).
Sample input data :
151020 130
151021 135
151022 132
151023 135
151024 130
151025 135
151026 130
151027 135
151028 132
151029 130
151030 135
151031 135
My code:
public int count(String k) {
int l = arr.length;
for (int i = 0; i < l; i++){
if (arr[i] == k) {
count++ ;
}
}
return count;
}
java big-o
edited Nov 15 '18 at 22:26
Alperen
1,3551620
asked Nov 15 '18 at 21:40
Chandni DasariChandni Dasari
1
add a comment |
-1
Below is the code for find operation that I code for finding out the repeated values in direct addressing method. But the problem is that I have to design my code in such a way that time complexity will always be O(1).
Sample input data :
151020 130
151021 135
151022 132
151023 135
151024 130
151025 135
151026 130
151027 135
151028 132
151029 130
151030 135
151031 135
My code:
public int count(String k) {
int l = arr.length;
for (int i = 0; i < l; i++){
if (arr[i] == k) {
count++ ;
}
}
return count;
}
java big-o
edited Nov 15 '18 at 22:26
Alperen
1,3551620
asked Nov 15 '18 at 21:40
Chandni DasariChandni Dasari
1
I don't think that's possible with an array. You have to look at all the elements to know whether it matches.
– mypetlion
Nov 15 '18 at 21:59
5
O(1)means "constant time" - regardless of the input size. A constant time solution to finding duplicates in an arbitrarily sized list/array is not possible.
– John3136
Nov 15 '18 at 22:39
is there any another way of finding this.
– Chandni Dasari
Nov 16 '18 at 18:17
add a comment |
-1
-1
-1
Below is the code for find operation that I code for finding out the repeated values in direct addressing method. But the problem is that I have to design my code in such a way that time complexity will always be O(1).
Sample input data :
151020 130
151021 135
151022 132
151023 135
151024 130
151025 135
151026 130
151027 135
151028 132
151029 130
151030 135
151031 135
My code:
public int count(String k) {
int l = arr.length;
for (int i = 0; i < l; i++){
if (arr[i] == k) {
count++ ;
}
}
return count;
}
java big-o
edited Nov 15 '18 at 22:26
Alperen
1,3551620
asked Nov 15 '18 at 21:40
Chandni DasariChandni Dasari
1
Below is the code for find operation that I code for finding out the repeated values in direct addressing method. But the problem is that I have to design my code in such a way that time complexity will always be O(1).
Sample input data :
151020 130
151021 135
151022 132
151023 135
151024 130
151025 135
151026 130
151027 135
151028 132
151029 130
151030 135
151031 135
My code:
public int count(String k) {
int l = arr.length;
for (int i = 0; i < l; i++){
if (arr[i] == k) {
count++ ;
}
}
return count;
}
java big-o
java big-o
edited Nov 15 '18 at 22:26
Alperen
1,3551620
asked Nov 15 '18 at 21:40
Chandni DasariChandni Dasari
1
edited Nov 15 '18 at 22:26
Alperen
1,3551620
asked Nov 15 '18 at 21:40
Chandni DasariChandni Dasari
1
edited Nov 15 '18 at 22:26
Alperen
1,3551620
edited Nov 15 '18 at 22:26
Alperen
1,3551620
edited Nov 15 '18 at 22:26
Alperen
1,3551620
1,3551620
asked Nov 15 '18 at 21:40
Chandni DasariChandni Dasari
1
asked Nov 15 '18 at 21:40
Chandni DasariChandni Dasari
1
asked Nov 15 '18 at 21:40
Chandni DasariChandni Dasari
1
1
I don't think that's possible with an array. You have to look at all the elements to know whether it matches.
– mypetlion
Nov 15 '18 at 21:59
5
O(1)means "constant time" - regardless of the input size. A constant time solution to finding duplicates in an arbitrarily sized list/array is not possible.
– John3136
Nov 15 '18 at 22:39
is there any another way of finding this.
– Chandni Dasari
Nov 16 '18 at 18:17
add a comment |
I don't think that's possible with an array. You have to look at all the elements to know whether it matches.
– mypetlion
Nov 15 '18 at 21:59
5
O(1)means "constant time" - regardless of the input size. A constant time solution to finding duplicates in an arbitrarily sized list/array is not possible.
– John3136
Nov 15 '18 at 22:39
is there any another way of finding this.
– Chandni Dasari
Nov 16 '18 at 18:17
I don't think that's possible with an array. You have to look at all the elements to know whether it matches.
– mypetlion
Nov 15 '18 at 21:59
I don't think that's possible with an array. You have to look at all the elements to know whether it matches.
– mypetlion
Nov 15 '18 at 21:59
5
5
O(1) means "constant time" - regardless of the input size. A constant time solution to finding duplicates in an arbitrarily sized list/array is not possible.– John3136
Nov 15 '18 at 22:39
O(1) means "constant time" - regardless of the input size. A constant time solution to finding duplicates in an arbitrarily sized list/array is not possible.– John3136
Nov 15 '18 at 22:39
is there any another way of finding this.
– Chandni Dasari
Nov 16 '18 at 18:17
is there any another way of finding this.
– Chandni Dasari
Nov 16 '18 at 18:17
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53328271%2fcount-operation-in-direct-addressing-method-should-be-o1%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53328271%2fcount-operation-in-direct-addressing-method-should-be-o1%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
I don't think that's possible with an array. You have to look at all the elements to know whether it matches.
– mypetlion
Nov 15 '18 at 21:59
5
O(1)means "constant time" - regardless of the input size. A constant time solution to finding duplicates in an arbitrarily sized list/array is not possible.– John3136
Nov 15 '18 at 22:39
is there any another way of finding this.
– Chandni Dasari
Nov 16 '18 at 18:17