Arrays are simple, however reliable to employ in more condition than you can count. Arrays are utilized in those problems while the number of items to be solved out is fixed. They are uncomplicated to traverse, search & sort. It is extremely simple to manipulate an array instead of other subsequent data structures. Arrays are utilized in that condition in which the size of array can be established beforehand. Also, they are utilized in condition where insertions & deletions are minimal or not present. Insertion & deletion operations will lead to wastage of memory or will enhance the time complexity of the program because of the reshuffling of elements.

Posted Date: 4/4/2013 6:48:52 AM | Location : United States

Ask an Expert

Related Discussions:- Applications, Assignment Help, Ask Question on Applications, Get Answer, Expert's Help, Applications Discussions

Write discussion on Applications
Your posts are moderated

Write your message here..

Related Questions

Travelling salesman problem, Example 3: Travelling Salesman problem G... Example 3: Travelling Salesman problem Given: n associated cities and distances among them Find: tour of minimum length that visits all of city. Solutions: How several

Lists, In the previous unit, we have discussed arrays. Arrays are data stru... In the previous unit, we have discussed arrays. Arrays are data structures of fixed size. Insertion and deletion involves reshuffling of array elements. Thus, array manipulation

Splaying steps - splay trees, Readjusting for tree modification calls for r... Readjusting for tree modification calls for rotations in the binary search tree. Single rotations are possible in the left or right direction for moving a node to the root position

Write an algorithm to find outputs number of cars, A company is carrying ou... A company is carrying out a survey by observing traffic at a road junction. Every time a car, bus or lorry passed by road junction it was noted down. 10 000 vehicles were counted d

Explain about greedy technique, Explain about greedy technique The  gre... Explain about greedy technique The  greedy  method  suggests  constructing  a   solution  to  an  optimization  problem   by  a sequence of steps, every expanding a partially c

Data type, Data type An implementation of an abstract data type on a... Data type An implementation of an abstract data type on a computer. Therefore, for instance, Boolean ADT is implemented as the Boolean type in Java, and bool type in C++;

Array, how to define the size of array how to define the size of array

Define binary tree, Define Binary Tree  A binary tree T is explained as... Define Binary Tree  A binary tree T is explained as a finite set of nodes that is either empty or having of root and two disjoint binary trees TL, and TR known as, respectively

Compute the shortest paths to all network nodes, (i)  Consider a system usi... (i)  Consider a system using flooding with hop counter. Suppose that the hop counter is originally set to the "diameter" (number of hops in the longest path without traversing any

Random searching, write a program that find,search&replace a text string write a program that find,search&replace a text string