OOPD: Unit-I PDF
oopd: unit-1
OOP: Features
Sorting: Radix Sort
Radix Sort
Counting sort is a linear time sorting algorithm that sort in O(n+k) time when …
Sorting: Count Sort
Count Sort
Counting sort is a sorting algorithm that sorts the elements of an array by cou…
Sorting: Bucket Sort
Bucket Sort
Bucket Sort is a sorting technique that sorts the elements by first dividing th…
Sorting: Shell Sort
Shell Sort
The shell sort , sometimes called the “diminishing increment sort,” improves o…
Quick Sort
Quick Sort is also based on the concept of Divide and Conquer , just like merge…
Merge Sort
Merge Sort follows the rule of Divide and Conquer to sort a given set of numbe…
Insertion Sort
Insertion sort is based on the idea that one element from the input elements i…
Selection Sort
The Selection sort algorithm is based on the idea of finding the minimum or max…
Bubble Sort
Bubble sort is an algorithm that compares the adjacent elements and swaps thei…
Stability of Sorting Algorithms
Stability is mainly important when we have key value pairs with duplicate keys …
What is sorting? Types of Sortings
Sorting Algorithms are methods of reorganising a large number of items into som…
Fibonacci Search
Similarities with Binary Search: Works for sorted arrays A Divide and Conqu…
Binary Search
The binary search algorithm can be used with only a sorted list of elements. Bi…
Sentinel Linear Search
Sentinel Linear Search as the name suggests is a type of Linear Search where t…
Sequential Search (Linear Search)
Sequential search is also called as Linear Search. Sequential search starts at …
What is Searching? Types of Searching
Searching is the process of finding a given value position in a list of values.…
Generalised Linked List
Linked list is linear data structure, But when we create list into another list…
Insertion, Deletion, Reverse and Traversing Doubly Linked List
#include<iostream> #include<stdlib.h> using namespace std; class no…
Doubly Linked List
Disadvantages of Singly Linked List: We can traverse list from only one directi…
Insertion and deletion on Singly Linked List
/*Insert and delete the node at beginning , in-between and middle of singly …
Insert node at beginning, in-between and end of the linked list
#include<iostream> #include<stdlib.h> using namespace std; cla…
How to insert node into linked list
#include<iostream> using namespace std; class node { int data; nod…
How to create node in Linked list using c++
#include<iostream> using namespace std; class node { int data; nod…
Difference between Static and Dynamic Memory allocation
Static Memory Allocation In this case, variables get allocated permanentl…
New and delete operator
New and delete operator: used for memory allocation & deallocation in oop:…
Static & Dynamic Memory Allocation
Static Memory Allocation: In Static Memory Allocation the memory for your …
Memory Management
Memory management is the process of controlling and coordinating computer mem…
Sparse Matrix
A 2-dimensional array in programming is often represented by ‘m’ rows and ‘n’…
Order List : Single Variable Polynomial
Order list is the most common & frequently used data object. Linear el…
2- D Array & Address Calculation using Row Major and Column Major
we can create an array of an array, known as a multidimensional array. 2-D A…
1-D Array and Storage Representation
Syntax for array declaration: Datatype array_name [size]; Now consider th…
What & Why Array? How Sequential Data Stored in Computers?
Whenever we want to work with large number of data values, we need to use th…
Algorithm Strategies
General approaches to the construction of efficient solution to problems…
Asymptotic Notation (Big O, Big Ω, Big θ )
Asymptotic notation of an algorithm is a mathematical representation of its com…
Performance Analysis and Complexity
Performance Analysis: There are multiple algorithms to solve a problem. When we…
Data Structure and Algorithms
Data Structure, ADT and Type of data structure
Abstract Data Type (ADT): A data type can be considered abstract when it is def…
Data Structure and Algorithms
Introduction to Algorithm and Data Structures
Difference Between Data, Information and Knowledge Data: We always use wo…
