This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
blog:fall2015:hju:journal [2015/11/11 14:20] – hju | blog:fall2015:hju:journal [2015/12/01 00:17] (current) – hju | ||
---|---|---|---|
Line 67: | Line 67: | ||
====November 11, 2015==== | ====November 11, 2015==== | ||
I finally finished my dll1. I was really scared of swapnode and sortnode. However, I think I did well. Actually, I had problem with compare. I wasn't able to assign values to the difference. However, the problem was solved. I forgot to put pointer there. Other than that, I had swapnode issue. I didn't think of the case where I have to swap the first and the second node in the list. Because of the error, I couldn' | I finally finished my dll1. I was really scared of swapnode and sortnode. However, I think I did well. Actually, I had problem with compare. I wasn't able to assign values to the difference. However, the problem was solved. I forgot to put pointer there. Other than that, I had swapnode issue. I didn't think of the case where I have to swap the first and the second node in the list. Because of the error, I couldn' | ||
+ | |||
+ | ====November 18, 2015==== | ||
+ | It was matter of pointers!! @_@ I had hard time figuring out the pointers that are all over the place. Returning status code wasn't hard. Dealing with double pointers was harder. So I completed the dls0. Stacks are fun and easy. It is because there are only top pointer and size. I didn't know that I had to make things up for the cpstack and pop function. I actually figured out by myself by making one more if statement. | ||
+ | |||
+ | else if( (*node) == NULL ) | ||
+ | |||
+ | By adding this line into the code, I recognized that all successful cases fell in to this if statement. Smart way to check it. :) Another part that made trouble was removing the thing that I made. Because I didn't recognize it earlier, I lost all my bonus points.. T_T... But not a big deal, I will shoot for it during the break. | ||
+ | |||
+ | ====November 30, 2015==== | ||
+ | |||
+ | I finished dlq0. It wasn't hard because it was similar to the last project. Queue was just time consuming project. Now I really got the concept of the pointer, address and so on. I can't wait for the last project eoce! |