What is a range - a structured type in ruby, Data Structure & Algorithms

Assignment Help:

Range: A Structured Type in Ruby

Ruby has a numerous structured types, comprising arrays, hashes, sets, classes, streams, and ranges. In this section we would only discuss ranges briefly as an instance of a structured type.

Range of T ADT signifies a set of values of type T (called the base type) between two extremes. Start value is a value of type T which sets the lower bound of a range, and end value is a value of type T which sets the upper bound of a range. Range itself is the set of values of type T between lower and upper bounds. For illustration, Range of Integers from 1 to 10 inclusive is the set of values {1, 2, 3, ..., 10}.

A range can be inclusive, meaning that it includes end value, or exclusive, meaning that it doesn't include the end value. Inclusive ranges are written with two dots between extremes, and exclusive ranges with three dots. Hence Range of Integers from 1 to 10 inclusive is written 1...10, and Range of Integers from 1 to 10 exclusive (the set {1, 2, 3, ..., 9}), is written 1...10.

A type can be a range base type only if it supports order comparisons. For instance, Integer, Real, and String types support order comparisons and so may be range base types however Sets and Arrays don't, so they can't be range base types.

 


Related Discussions:- What is a range - a structured type in ruby

Which sorting algorithms not have running time of o (n2), Which sorting al...

Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort

Explain multidimensional array, Multidimensional array: Multidimensional a...

Multidimensional array: Multidimensional arrays can be defined as "arrays of arrays". For example, a bidimensional array can be imagined as a bidimensional table made of elements,

Algo for quicksort, Easy algorithm for beginner for quicksort with explanat...

Easy algorithm for beginner for quicksort with explanation

Complexity of an algorithm, Q. Explain the complexity of an algorithm?  Wha...

Q. Explain the complexity of an algorithm?  What are the worst case analysis and best case analysis explain with an example.

The complexity ladder, The complexity Ladder: T(n) = O(1). It is ca...

The complexity Ladder: T(n) = O(1). It is called constant growth. T(n) does not raise at all as a function of n, it is a constant. For illustration, array access has this c

Java code and algorythem, Suppose that you want to develop a program that a...

Suppose that you want to develop a program that accepts a postfix expression and asks values for variables in the expression. Then you need to calculate the answer for the expressi

Darw a flowchart to inputs top speeds of 5000 cars, Write an algorithm in t...

Write an algorithm in the form of a flowchart that: inputs top speeds (in km/hr.) of 5000 cars Outputs fastest speed and the slowest speed Outputs average (mean) s

What is string, What is String Carrier set of the String ADT is the s...

What is String Carrier set of the String ADT is the set of all finite sequences of characters from some alphabet, including empty sequence (the empty string). Operations on s

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