Below is a code segment for the Deleteltem function in an unsorted li.pdf
0 likes7 views
The document describes a code segment for the 'deleteitem' function in an unsorted list using a static array, detailing the implementation of the deletion logic and the handling of the search process. It specifies that at most one item with the same key exists in the list, and the running time complexity of the deletion operation is O(n). Additionally, it includes a reference to another function, 'insertitem', that adds an item to the list.
1 of 1
Download to read offline
![Below is a code segment for the Deleteltem function in an unsorted list implemented using a
static array Fill in the blank sections of code to successfully implement a deleted item void
UnsortedType::DeleteItem(ListItemType& item) There is at most one list item with the same
key as item; there may be none. Post: No list element has the same key as item. int location =
0; int index; bool moreToSearch; more search = bool found = false; while switch
(item.CompardTo(info[location])) case LESS: location^++ moretosearch = break; case
EQUAL:....= true break; if (found) {info [location] = leanth^-- What is the running time of the
Deleteltem operation?
Solution
A) 1.) false
2.) moreToSearch
3) True
4) True
5) found
6) item
B) Time Complexity T(N) = O(N)
C)
template
void UnsortedType::InsertItem(ItemType item)
// item is in the list; length has been incremented.
{
NodeType* location;
location = new NodeType;
location->info = item;
location->next = listData;
listData = location;
length++;
}](https://image.slidesharecdn.com/belowisacodesegmentforthedeleteltemfunctioninanunsortedli-230707193915-33561db5/85/Below-is-a-code-segment-for-the-Deleteltem-function-in-an-unsorted-li-pdf-1-320.jpg)
More Related Content
Similar to Below is a code segment for the Deleteltem function in an unsorted li.pdf (20)
Ad
More from shalins6 (20)
Ad
Below is a code segment for the Deleteltem function in an unsorted li.pdf
- 1. Below is a code segment for the Deleteltem function in an unsorted list implemented using a static array Fill in the blank sections of code to successfully implement a deleted item void UnsortedType::DeleteItem(ListItemType& item) There is at most one list item with the same key as item; there may be none. Post: No list element has the same key as item. int location = 0; int index; bool moreToSearch; more search = bool found = false; while switch (item.CompardTo(info[location])) case LESS: location^++ moretosearch = break; case EQUAL:....= true break; if (found) {info [location] = leanth^-- What is the running time of the Deleteltem operation? Solution A) 1.) false 2.) moreToSearch 3) True 4) True 5) found 6) item B) Time Complexity T(N) = O(N) C) template void UnsortedType::InsertItem(ItemType item) // item is in the list; length has been incremented. { NodeType* location; location = new NodeType; location->info = item; location->next = listData; listData = location; length++; }