X-Git-Url: http://gitweb.michael.orlitzky.com/?p=octave.git;a=blobdiff_plain;f=partition.m;fp=partition.m;h=ac616cf5891d6f0e7c2f3d4322b8ab22b383e705;hp=0000000000000000000000000000000000000000;hb=1a5bceb9de6bd3a511e7edcb6ab08f84dae63948;hpb=7e9b78da72817519f82477be5e9852ed04913aa9

diff --git a/partition.m b/partition.m
new file mode 100644
index 0000000..ac616cf
--- /dev/null
+++ b/partition.m
@@ -0,0 +1,28 @@
+function [p,delta] = partition(integerN, a, b)
+  ## Partition the interval [a,b] into integerN subintervals. We do not
+  ## requite that a<b.
+  ##
+  ## INPUTS:
+  ##
+  ##   * integerN - The number of subintervals.
+  ##
+  ##   * a - The "left" endpoint of the interval to partition.
+  ##
+  ##   * b - The "right" endpoint of the interval to partition.
+  ##
+  ##
+  ## OUTPUTS:
+  ##
+  ##   * p - The resulting partition, as a vector of length integerN+1.
+  ##
+  ##   * delta - The distance between x_i and x_{i+1} in the partition.
+  ##
+  ##
+
+  ## We don't use abs() here because `b` might be less than `a`. In that
+  ## case, we want delta negative so that when we add it to `a`, we move
+  ## towards `b`.
+  delta = (b - a)/integerN
+
+  p = [a : delta : b]
+end