Sorting
Selection Sort: Take out the curr elem and compare with all elements to the right to find smallest elem.
Swap curr and smallest. arr[] = {9, 6, 7, 5, 2};
Merge Sort
Popular posts from this blog
Quick Sort
Lomuto Hoare
Link List
#include "bits/stdc++.h" using namespace std; class Node { public: int data; Node *next; Node(int d) : data(d), next(NULL) {} }; class LinkedList { private: Node *head; public: LinkedList() : head(nullptr) {} ~LinkedList() { Node *curr = head; while(curr != NULL) { Node *nextNode = curr->next; delete curr; curr = nextNode; } } void insertAtHead(int data) { Node *tempNode = new Node(data); tempNode->next = head; head = tempNode; } void printList() { Node *currNode = head; if (currNode == nullptr) { cout data "; currNode = currNode->next; } cout data == key) { Node *tempNode = head; head = head->next; delete tempNode; return; } // 3. Delete last node Node *curr = head; Node *prev = nu...
Comments
Post a Comment