answersLogoWhite

0

by using index position we can find the particular element in array.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

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);


What search begin the search with the first array element?

To search, you would start with the first element of the array and compare it with the target value. If the first element matches the target, you found it. If not, you would move to the next element in the array and repeat the process until either you find the target or exhaust all elements in the array.


How many comparisons are typically required in a binary search algorithm to find a specific element in a sorted array?

In a binary search algorithm, typically log(n) comparisons are required to find a specific element in a sorted array, where n is the number of elements in the array.


The minimum number of comparisons requied to find the second smallest element in a 1000 element array is?

1010


What is the maximum number of comparisons required in a binary search algorithm to find a specific element in a sorted array?

The maximum number of comparisons required in a binary search algorithm to find a specific element in a sorted array is log(n), where n is the number of elements in the array.


What is the value of the kth smallest element in the given array?

The value of the kth smallest element in the array is the kth element when the array is sorted in ascending order.


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; }


What is the time complexity of an algorithm that uses a binary search to find an element in a sorted array in logn time?

The time complexity of an algorithm that uses binary search to find an element in a sorted array in logn time is O(log n).


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.