Ninja Technik

Search This Blog

Lets Go!

Posted by Abhishek Sinha on January 10, 2022

Get link
Facebook
X
Pinterest
Email
Other Apps

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Get LinkedIn 6 Months Subscription For Free

STEP 1 : Go to the LinkedIn Premium page and locate this form. STEP 2: Fill in all the required details in the form (note: enter the Linkedin email id) STEP 3: upload the identity card of your college and wait for processing. STEP 4: Wait for Processing ( It will take Few Seconds ) Get Your Premium here Follow us on Instagram : https://www.instagram.com/ninja.technik/

Linked List Insertion

Creating Node: struct Node { int data; struct Node *next; }; Traversing Function: void Traversed_link_list(struct Node *ptr) { while (ptr != NULL) { cout << "Element: " << ptr->data << endl; ptr = ptr->next; } } Insert at the beginning: struct Node *insert_at_beginning(struct Node *head, int data) { struct Node *ptr; ptr = new Node(); // Memory allocation for new Node ptr->next = head; ptr->data = data; head = ptr; return head; } Insert at the particular index: struct Node *insert_at_Index(struct Node *head, int data, int index) { struct Node *ptr; ptr = new Node(); // Memory allocation for new Node struct Node *p = head; int i = 0; while (i != index - 1) { p = p->next; i++; } ptr->data = data; ptr->next = p->next; p->next = ptr; return head; } Insert at the End: struct Node *insert_at_end(struct Nod...

Bubble sort

The bubble sort works by comparing each item in the list with the item next to it and swapping them if required The algorithm repeats this process until it makes a pass all the way through the list without swapping any items (in other words, all items are in the correct order) This causes larger values to ‘bubble’ to the end of the list while smallervalues ‘sink’ towards the beginning of the list In brief, the bubble sort derives its name from the fact that the smallest data item bubbles up to the topof the sorted array Bubble sort complexity The time complexity of bubble sort in the best case, average case, and worst case. 1. Time Complexity Case Time Complexity a]Best Case O(n) b]Average Case O(n 2 ) c]Worst Case O(n 2 ) Best Case Complexity - It occurs when there is no sorting required, i.e. the array is already sorted. The best-case time c...

Powered by Blogger

Lets Go!

Comments

Post a Comment