preview

Unit 5 Programming Portfolio 1

Better Essays
Open Document

Student number: 5904068 30.10.2015

Module: 210СCT

Programming Portfolio 1.

Contents
Task 1: Harmonic Series………………………………………………….3

Task 2...................................................…………………………………3-4

Task 3: Range Search….………………….…………………………….4-5

Task 4: Node Delete Function…………….…………………………….5

Appendix: Full C++ code...................................................................6-7

Task 1: Harmonic Series

a) def harmonic(n): …show more content…

Input: array arr, int size, int key
Ouput: int position , if found, else -1 def: binary_search(arr, key, l, u)

Where l = 0, r = size – 1 If ( u > l) return -1; mid = (l + u)/2; if (arr[mid] > value)
return binary_search(arr, key, l, mid - 1); else if (arr[mid] < value)
return binary_search(arr, value, mid + 1, u); else return mid;
The run-time complexity of this algorithm is O(log(n)).
Task 4:Node Delete Function

void NodeDeleteFunctoin(int l)
{
Node* temp = head; //Point that we need a beginning of the list
Node* prev = NULL; //Previous element is empty
Node* next = NULL; //Next element is empty while (temp != NULL) { if (temp->value == l) { //Delete a first node but there are others if (temp == head) { //Point that we need a beginning head = temp->next; //We shift the starting of the beginning of the next element if (head != NULL) {head->prev = NULL;}
}
else if (temp == tail) //Point that we need a tail
{
prev = temp->prev; //Move the tail in the back prev->next = NULL; //Point that there is nothing before the tail tail = prev; //Remember the address of the removable

Get Access
Related
Get Access