MedVision ad

The 'derivative' of a sequence. (1 Viewer)

GoldyOrNugget

Señor Member
Joined
Jul 14, 2012
Messages
583
Gender
Male
HSC
2012
Does this 'sequence derivative' have a proper term? It comes up all the time in informatics. I've always called it the 'delta array' for lack of a better term. And there's also its 'integral' equivalent, which we call the cumulative array, where the nth term is the sum of terms 0..n. That one has the nice property that you can construct it in linear time with

Code:
cum[0] = arr[0]
for i = 1 to n
  cum[i] = arr[i] + cum[i-1]
and then perform range sum queries in constant time; the sum of elements i..j can be found with a single operation, cum[j] - cum[i-1] (or just cum[j] if i == 0)
 

braintic

Well-Known Member
Joined
Jan 20, 2011
Messages
2,137
Gender
Undisclosed
HSC
N/A
Would a moderator please move this thread elsewhere. It is not high school maths.
 

seanieg89

Well-Known Member
Joined
Aug 8, 2006
Messages
2,662
Gender
Male
HSC
2007
Would a moderator please move this thread elsewhere. It is not high school maths.
The induction question is very much high school maths. The exploration at the end is only for people who want to look at it further.
 

seanieg89

Well-Known Member
Joined
Aug 8, 2006
Messages
2,662
Gender
Male
HSC
2007
Does this 'sequence derivative' have a proper term? It comes up all the time in informatics. I've always called it the 'delta array' for lack of a better term. And there's also its 'integral' equivalent, which we call the cumulative array, where the nth term is the sum of terms 0..n. That one has the nice property that you can construct it in linear time with

Code:
cum[0] = arr[0]
for i = 1 to n
  cum[i] = arr[i] + cum[i-1]
and then perform range sum queries in constant time; the sum of elements i..j can be found with a single operation, cum[j] - cum[i-1] (or just cum[j] if i == 0)
Probably, I have not done much informatics. It is a pretty natural construction to make, (as is the summatory analogue).
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top