-
Pointer as Functions
How a value can be accessed through an address?How pointers can be used a funtions?
PPreksha
- Dec 15th, 2009
A value can be accesed through its address by use of pointers..Assigning any element as int x=10;int *p=&x;assigns the address of 'x' to pointer 'p'A pointer can be used as a funct...
-
Explain about Linear and Nonlinear data structures
sureshds
- Dec 26th, 2009
If the elements/nodes have a single successor and predecessor then the list is said to be linear.Stacks and queues are Linear.Linked lists are linear in terms of accessing and non-linear interms of storage.Trees and graphs are pure non-linear.
vinod148
- Oct 23rd, 2009
Linear: May not need pointers to access Need more time for searching than non-linear Easier to access Non-linear: &nb...
-
Data Structure for one million named objects
If you have one million named objects and you want to store them in a data structure that lets you insert new objects quickly and search for an object by name quickly, what data structure should you use?
Read Best Answer
Editorial / Best Answer
hrshksh- Member Since May-2010 | May 9th, 2010
It depends on the amount of primary memory one has for the process. If we can store 1 million records in primary memory, then we can very well take a hash table with a consistent hashing scheme for avoiding collisions. It will take O(1).
In most cases however this is not possible. In circumtances like this, there are two ways:B Trees or Extensible Hashing both of them have interesting time complexities.ptmich
- May 28th, 2012
You can use a hash table or an array of objects You can use an array of objects because you already know that you need to store a specified number of objects, also you can store and access objects qu...
hrshksh
- May 9th, 2010
It depends on the amount of primary memory one has for the process. If we can store 1 million records in primary memory, then we can very well take a hash table with a consistent hashing scheme for av...
-
Data Structure - character that repeats itself
Given a string of characters (let us say there are about 100 characters or more in the string), what is the most efficient method to use for finding out the character that repeats itself the most?Is it possible for us to use some kind of data structure for this?, if this is so,which is the best one that needs to be used?
vinod148
- Oct 23rd, 2009
There is no way for less that O(n) solution as we have to traverse the string atleast once.By traversing only once we can find the solutionKeep another variable which tracks the current highest occured character.
pvsola
- Apr 3rd, 2008
There is an way to solve this issue with complexity of O(n).1. MAke an array size of 2562. Using each charater read from the string as an index incremented the counter ...
-
What are the various kinds of sorting techniques? Which is has least worst case?
These are some sorting techs,bubble sortquick sortinsertion sortselection sortmerge sortheap sorttell me any more sorting is found..... ad which is best....
akshay
- Aug 25th, 2011
BUBBLE SORT:
Code- BUBBLE SORT:
- #include<iostream.h>
- #include<string.h>
- #include<math.h>
- #include<stdlib.h>
- void main()
- {
- int a[10],n,temp;
- cout<<"Enter number of elements:";
- cin>>n;
- cout<<"Enter no's: "<<endl;
- for(int i=0;i<n;i++)
- {
- cin>>a[i];
- }
- cout<<"Sorted list is:";
- for(int m=0;m<n-1;m++)
- {
- for(int p=m+1;p<n;p++)
- {
- if(a[p]<a[m])
- {
- temp=a[p];
- a[p]=a[m];
- a[m]=temp;
- }
- }
- }
- for(int x=0;x<n;x++)
- {
- cout<<a[x]<<endl;
- }
- }
vinod148
- Oct 23rd, 2009
HEAP sort is the best algorithmO(n log n) time for best, avg and worst caseO(1) spacelet me know if any other sorting algorithm present if that exceeds the limit i gave
-
