0
by using index position we can find the particular element in array.
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
The contents of a particular element of an array is called?
It is the value of the element.
What is the index number of the last element of an array with 9 elements?
(array.length - 1) will find the index of the last element in an array (or -1 if the array is empty).
How will you find the location of an element of an array?
Basically, &array[i]; That is, the memory location for an array object with index i. Or, you can do: (array + i);
The minimum number of comparisons requied to find the second smallest element in a 1000 element array is?
1010
Will an array element be deleted when you retrieve it from the array?
You cannot delete from an array.
Write a c program to find the maximum value of 25 element in an array?
int findMax(int *array) { int max = array[0]; for(int i = 1; i < array.length(); i++) { if(array[i] > max) max = array[i] } return max; }
If array is full how you apply linear search?
An array in C is structured so that it has no particular size; you have to know ahead of time what the dimensions are.So, a linear search means that you go from the first element to the last, either finding the element in the table, or going to the very last element and not finding it.Arrays in C can be zero-terminated, in which case you get the element that does not have a value, and that indicates the value you are searching for is not there.If the array is not zero terminated then you can calculate the dimension of the array, or apply the sizeof operator times the size of the first element to determine the length of the search.
Which element of array does this expression refer num5?
which element of the array does this expression reference num[5]
To check if a particular element present in 2 d array?
for(int i = 0; i < [length][] ; i ++){ for(int j = 0; i < [][length]; i++){ if(array[i][j].equals(object)){ return true; } } } return false; Or something..
How do you find address of an element in a 3d array?
C-style example: sometype array [P][Q][R]; addr (array,I,J,K) = (char *)array + sizeof (sometype)*(I*Q*R + J*R + K)
How do you represent binary tree using array?
The root of the tree is stored in array element [0]; for any node of the tree that is stored in array element [i], its left child is stored in array element [2*i], its right child at [2*i+2]
What search begin the search with the first array element?
The search for the first array element begins at the assembly plant. As they array is being constructed, the element itself is one of the first components to be completed.
