more comments.

nmb10 · nmb10 · commit 09048bc3391e · 2014-04-26T10:33:50.000+04:00
diff --git a/cachematrix.R b/cachematrix.R
@@ -1,4 +1,4 @@
-## Matrix inversion is usually a costly computation and their may be some
+## Matrix inversion is usually a costly computation and there may be some
 ## benefit to caching the inverse of a matrix rather than compute it repeatedly.
 ## This two functions do exactly that. Create matrix that stores its inverse (using makeCacheMatrix)
 ## then get its inverse (using  cacheSolve)
@@ -24,15 +24,22 @@
 makeCacheMatrix <- function(mtx = matrix()) {
     cachedInverse <- NULL
     set <- function(y) {
+        # changes initial matrix and removes old matrix cache
         mtx <<- y
         cachedInverse <<- NULL
     }
     get <- function() mtx
-    setInverse <- function(inv) cachedInverse <<- inv
-    getInverse <- function() cachedInverse
-    list(set = set, get = get,
-         setInverse = setInverse,
-         getInverse = getInverse)
+    setInverse <- function(inv) {
+        # sets inverse version of the matrix
+        cachedInverse <<- inv
+    }
+    getInverse <- function() {
+        # returns inverse of the matrix
+        cachedInverse
+    }
+    list(set=set, get=get,
+         setInverse=setInverse,
+         getInverse=getInverse)
 }
 
 
@@ -43,8 +50,10 @@ makeCacheMatrix <- function(mtx = matrix()) {
 cacheSolve <- function(x, ...) {
     inv <- x$getInverse()
     if(!is.null(inv)) {
+        # cached invers exists, return it
         return(inv)
     }
+    # inverse is not cached yet, cache it and return
     mtx <- x$get()
     inv <- solve(mtx, ...)
     x$setInverse(inv)
