[Haskell-beginners] Calculating Time Complexity

26 Jan 2009

      Dear all,

In general terms, how would one calculate the time complexity of a 
given algorithm? Feel free to make use of my pseudo code in your answer:

			/* input:
			2-D array A of size n by n
			   output: a number max */
			Max := 0
			For i := 1 to n
			  sum := 0
			  For j := 1 to n
			    sum := sum + A[i][j]
			  End for
			  If sum > max then max := sum
			End for
			   Output max

	Sincerely
	Matthew J. Williams