diff --git a/Data/LinearSplit.hs b/Data/LinearSplit.hs
--- a/Data/LinearSplit.hs
+++ b/Data/LinearSplit.hs
@@ -9,13 +9,16 @@
 --
 -- The LinearSplit module implements partitioning the sequence of items to the 
 -- subsequences in the order given. The next functions are exported:
---    a) gPartition  - split the sequence of items items using greedy heuristic. 
---    b) lPartition  - split the sequence of items to minimize the maximum cost over 
---                     all the subsequences using linear partition algorithm
---                     (see the 'The Algorithm Design Manual' by Steven S. Skiena..)  
---    c) ltPartition - the approximation of the linear partition algorithm.
---                     The large size of the work items space is decreased by
---                     combining the consecutive items based on the threshold parameter.
+--
+-- * gPartition. Split the sequence of items items using greedy heuristic. 
+--
+-- * lPartition. Split the sequence of items to minimize the maximum cost over 
+--   all the subsequences using linear partition algorithm
+--   (see the 'The Algorithm Design Manual' by Steven S. Skiena..)  
+--
+-- * ltPartition. The approximation of the linear partition algorithm.
+--   The large size of the work items space is decreased by
+--   combining the consecutive items based on the threshold parameter.
 -- 
 
 module Data.LinearSplit (
diff --git a/LinearSplit.cabal b/LinearSplit.cabal
--- a/LinearSplit.cabal
+++ b/LinearSplit.cabal
@@ -1,10 +1,13 @@
 Name:                LinearSplit
-Version:             0.2
+Version:             0.2.1
 Synopsis:            Partition the sequence of items to the subsequences in the order given
 Description:         The LinearSplit module implements partitioning the sequence of items to the 
                      subsequences in the order given. The items can be splitted using greedy 
                      heuristic or using the linear partition algorithm to minimize the maximum cost
-                     over all ranges (see the 'The Algorithm Design Manual' by Steven S. Skiena..)
+                     over all ranges (see the 'The Algorithm Design Manual' by Steven S. Skiena..). 
+                     .
+                     The library can be used to balance the work across processors to minimize the run time.
+                     For the library usage take a look in examples/Splitter.hs. 
 License:             BSD3
 License-File:        LICENSE
 Author:              Vitaliy Rukavishnikov
diff --git a/examples/Splitter.hs b/examples/Splitter.hs
--- a/examples/Splitter.hs
+++ b/examples/Splitter.hs
@@ -10,7 +10,11 @@
 -- Portability :  non-portable
 
 -- Balance the work items accross processors to minimize the total elapsed time.
--- For help use ./Splitter --help
+--
+-- For example, the next program invocation  will split the items in test1.txt on 
+-- 5 ranges using greedy heuristics and linear partition algorithm.
+-- $ Splitter -f test1.txt -n -o -g -t500 -s5
+
 
 module Main where
 import System.IO