Merge pull request #16 from branch 'jstnlef-reverse-linked-is-n'

* jstnlef-reverse-linked-is-n:
  the Time complexity for reversing a linked list is O(n)
This commit is contained in:
Donne Martin 2015-07-12 06:47:55 -04:00
commit f47479a7dc

View File

@ -66,7 +66,7 @@
" * Only need to compare the first half\n",
"\n",
"Complexity:\n",
"* Time: O(1)\n",
"* Time: O(n)\n",
"* Space: O(n)\n",
"\n",
"Note:\n",