arc/notes
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

vault backup: 2024-11-19 21:49:36

Browse Source
This commit is contained in:
zleyyij 2024-11-19 21:49:36 -07:00
parent 7661f4b835
commit b677e73bbe
1 changed files with 13 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
education/software development/ECE1400/Chapter 17 Exercises.md
View File

@ -42,7 +42,7 @@ The above loop won't function because it deallocates the entry, then attempts to
A functional example might look like this:
```c
struct entry* p = first;
struct entry *p = first;
while (p != NULL) {
void *current = p;
p = p->next;
@ -58,4 +58,15 @@ while (p != NULL) {
---
> **13.** The following function is supposed to insert a new node into its proper place in an ordered list, returning a pointer to the first node in the modified list. Unfortunately
> **13.** The following function is supposed to insert a new node into its proper place in an ordered list, returning a pointer to the first node in the modified list. Unfortunately, the function doesn't work correctly in all cases. Explain what's wrong with it and show how to fix it. Assume that the `node` structure is the one defined in Section 17.5.
```c
struct node *insert_into_ordered_list(struct node *list, struct node *new_node) {
struct node *cur = list, *prev = NULL;
while (cur->value <= new_node->value) {
}
prev->next = new_node;
new_node->next = cur;
return list;
}
```