Explain the arrays in ruby, Data Structure & Algorithms

Assignment Help:

Explain the Arrays in Ruby

Ruby arrays are dynamic arrays which expand automatically whenever a value is stored in a location beyond current end of the array. To the programmer, it's as if arrays are unbounded and as many locations as are needed are available. Locations not assigned a value in an expanded array are initialized to nil by default. Ruby also has an interesting indexing mechanism for arrays. Array indices begin at 0 so, for instance, a[13] is the value in the 14th position of the array. Negative numbers are indices of elements counting from current end of the array, so a[-1] is the last element, a[-2] is the second to last element, and so forth. Array references which use an out-of-bound index return nil. These features combine to make it difficult to write an array reference which causes an indexing error. This is apparently a great convenience to the programmer however actually it's not since it makes it so hard to find bugs: many unintended and erroneous array references are legal.

 


Related Discussions:- Explain the arrays in ruby

Breadth-first search, Breadth-first search starts at a given vertex h, whic...

Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

Time complexity, how to learn about time complexity of a particular algorit...

how to learn about time complexity of a particular algorithm

Graph traversal schemes, Q. Explain various graph traversal schemes and wri...

Q. Explain various graph traversal schemes and write their advantages and disadvantages. A n s . Graph Traversal Scheme is explained below In many troubles we wish

Perfect matching polytope ppm, Let G=(V,E) be a graph for which all nodes h...

Let G=(V,E) be a graph for which all nodes have degree 5 and where G is 5-edge is connected. a) Show that the vector x which is indexed by the edges E and for which xe = 1/5 for

Binary search trees, In this unit, we discussed Binary Search Trees, AVL tr...

In this unit, we discussed Binary Search Trees, AVL trees and B-trees. The outstanding feature of Binary Search Trees is that all of the elements of the left subtree of the root

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

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

The data structure required to evaluate a postfix expression, The data stru...

The data structure needed to evaluate a postfix expression is  Stack

Determine the stereo vision, Determine the stereo vision There is still...

Determine the stereo vision There is still one more major item missing, before we can look at a computer display or plot and perceive it just as we see a real object, namely th

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd