C1320prespost

Sticky Bits in C ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Sticky Bits in C Control Structures

Control Structures ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Sticky Bits in C Variable Types And Pointers!

Data Types ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Pointer Variable Notes ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Using Pointers to Allocate Space ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Sticky Bits in C Recursion Recursion Recursion Recursion Recursion Recursio Recurs

Recursion Development ,[object Object],[object Object],[object Object],[object Object],[object Object]

Recursion - Example ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],It should be noted that one of the most difficult things about recursion with Fibonacci is the magical decision to number the Fibonacci elements and then to use that number as n . This is akin to mathematical proofs where the author says “So now we let k stand for a+*m%r#p^t …”

Recursion - What is it doing!?@#! ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Fib(5) = 5 Fib(4) = 3 Fib(3) = 2 Fib(3) = 2 Fib(2) = 1 Fib(2) = 1 Fib(1) = 1 Fib(2) = 1 Fib(1) = 1 = + + + + = = = 2 2 5 3 Notice that the recursion isn’t finished at the bottom -- It must unwind all the way back to the top in order to be done.

Recursion - Should I or Shouldn’t I? ,[object Object],[object Object],[object Object],[object Object],[object Object]

Sticky Bits in C Arrays and Structs

Aggregate Data Structures ,[object Object],[object Object],[object Object],[object Object],[object Object]

Aggregate Data Types - Structures ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Structure Operations and Member Accessing ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Arrays and Pointers and Structures Oh My! ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],H E T D S A E C M 3.95 Imad Tibi 744521111 E 4.0 Rose Axel 000003789 P 3.4 Marta Luitania 654903211 major[4] GPA first_nm last_nm ID_num

Data Structures built with Structs ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],UTA UTA UTA UTA ->next_stdt ->next_stdt ->next_stdt

Linked Lists ,[object Object],[object Object],[object Object],[object Object],[object Object],UTA UTA UTA ->next_stdt ->next_stdt ->next_stdt head travel UTA new UTA

Linked Lists ,[object Object],[object Object],[object Object],[object Object],UTA pi A list element might consist of a uta_student struct with a last_name value of pi along with other member values UTA UTA UTA UTA ->next_stdt ->next_stdt ->next_stdt head travel UTA new alpha phi nu tau zeta

Linking the List ,[object Object],[object Object],[object Object],[object Object],[object Object],new = (struct uta_student *)malloc (sizeof (struct uta_student)); new->last_name = “pi”; /* other data initialized */ (*new).next_stdt = NULL;

Linking the List ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],/* in some sort of loop */ if ( new->last_name < travel->last_name) /* then new goes in the list before travel */ else travel = travel->next_stdt; UTA UTA UTA UTA ->next_stdt ->next_stdt ->next_stdt head travel alpha UTA new phi nu tau zeta

Linking the List ,[object Object],[object Object],[object Object],[object Object],[object Object],/* using the travel pointer and a follow pointer which is one link behind the travel pointer */ if ( new->last_name < travel->last_name) { /* insert node */ new->next_stdt = travel; follow->next_stdt = new; }

Doubly Linking the List ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],UTA UTA UTA UTA ->next_stdt ->next_stdt ->next_stdt head travel UTA new alpha phi nu tau zeta ->prev_stdt ->prev_stdt ->prev_stdt follow

Doubly Linking the List if ( new->last_name < travel->last_name) { /* insert node */ new->next_stdt = travel; new->prev_stdt = follow; follow->next_stdt = new; travel->prev_stdt = new; } ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],UTA UTA UTA ->next_stdt ->next_stdt follow travel tau ->prev_stdt ->prev_stdt new nu phi

Sticky Bits in C Debugging. Ugh.

[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Debugging. Ugh.

Debugging. Ugh. ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Debugging. Ugh.

C1320prespost

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Was ist angesagt?

Was ist angesagt? (20)

Andere mochten auch

Andere mochten auch (20)

Ähnlich wie C1320prespost

Ähnlich wie C1320prespost (20)

Mehr von FALLEE31188

Mehr von FALLEE31188 (20)

Kürzlich hochgeladen

Kürzlich hochgeladen (20)

C1320prespost