News
Entertainment
Science & Technology
Life
Culture & Art
Hobbies
News
Entertainment
Science & Technology
Culture & Art
Hobbies
Random Shuffle and Permutations in NumPy - DataFlair
Machine Learning courses with 100+ Real-time projects Start Now!! Program 1 # Random Shuffle and Permutations in NumPy #shuffle() and permutation(). import numpy as np from numpy import random # mylist=['12@56','Yu562',345,'Thg78$',67.677] # mylist=random.permutation(mylist) #...
C++ Project - Login Application - DataFlair
Master C++ with Real-time Projects and Kickstart Your Career Start Now!! Program 1 // Login Application #include<iostream> #include<conio.h> #include<stdlib.h> #include<string.h> #include<time.h> #define clrscr() system("cls") using namespace std; int main() { clrscr(); char username[20]; char...
Shell Sort in DSA C++ - DataFlair
Program 1 // Shall Sort Implementation #include<iostream> #define clrscr() system("cls") using namespace std; int main() { int a[500],n,i,j,gap,temp; clrscr(); xyz:cout<<"nEnter the limit of array"; cin>>n; if(n>500) { cout<<"nInvalid limit enter again"; goto xyz; }...
Insertion Sort in DSA using Python - DataFlair
Program 1 # Implementation of Insertion sort import os mylist=[] os.system('cls') n=int(input("Enter the limit: ")) for i in range(n): x=int(input()) mylist.append(x) # Insertion sort for k in range(1,n): temp=mylist[k] j=k-1 while(temp<mylist[j] and j>=0): mylist[j+1]=mylist[j]...
Selection Sort in DSA using Python - DataFlair
Program 1 #Program for Selection sort import os os.system('cls') mylist=[] n=int(input("Enter the limit")) print("Enter an elements") for i in range(0,n): x=int(input()) mylist.append(x) for i in range(0,n): min=mylist[i] loc=i for j in range(i+1,n): if(mylist[j]<min): min=mylist[j]...
Quick Sort in DSA using Python - DataFlair
Program 1 #Program for Quick Sort import os def quick_sort(mylist,l,h): # l=0 h=9 low=l # low=0 high=h # high=9 key=mylist[(low+high)//2] # Pivot element while(low<=high): while(key>mylist[low]): low=low+1 while(key<mylist[high]): high=high-1 if(low<=high): mylist[low],mylist[high]=mylist[high],mylist[low] low=low+1 high=high-1 if(l<=high): quick_sort(mylist,l,high)...
Bubble Sort in DSA C++ - DataFlair
Program 1 // Implementation of Bubble Sort #include<iostream> using namespace std; int main() { system("cls"); int ar[500],n,i,j,temp; cout<<"Enter the limit: "; cin>>n; cout<<"n Enter the elements: "; for(i=0;i<n;i++) cin>>ar[i]; for(i=0;i<n;i++) { for(j=0;j<n-i-1;j++) { if(ar[j]>ar[j+1])...
Linear Sort in DSA C++ - DataFlair
Program 1 // Linear Sort #include<iostream> #include<stdio.h> using namespace std; int main() { system("cls"); int ar[500],n,i,j,temp; cout<<"n Enter the limit: "; cin>>n; cout<<"n Enter elements in array: "; for(i=0;i<n;i++) cin>>ar[i]; // sorting for(i=0;i<n;i++) {...
Quick Sort in DSA C++ - DataFlair
Program 1 // Program for Quick Sort #include<stdio.h> #include<conio.h> #include<iostream> #define clrscr() system("cls") using namespace std; void quick_sort(int ar[],int l ,int h); int main() { clrscr(); int ar[500],n,low,high; int i; xyz:cout<<"nEnter the limit"; cin>>n;...
Linear Search Algorithm in DSA C++ - DataFlair
Program 1 // Linear Search #include<iostream> #include<stdio.h> using namespace std; class Search { int myarrray[1000],s,len; public: Search(int myar[],int mys,int l) { for(int i=0;i<l;i++) { myarrray[i]=myar[i]; } s=mys; len=l; } int mysearch() { int i;...
Reverse a Linked List in DSA C++ - DataFlair
Program 1 #include<iostream> #include<stdio.h> using namespace std; class Node { int data; Node *add; public: void create(); void display(); void insert_first(); void insert_middle(); void insert_last(); void delete_first(); void delete_middle(); void delete_last(); void searchData(); void...
Binary Search in DSA C++ - DataFlair
Program 1 //Binary Search #include<iostream> #include<stdio.h> using namespace std; int main() { system("cls"); int ar[500],n,i,j,s,temp,low,high,mid,flag=0; cout<<"n Enter the limit of array: "; cin>>n; cout<<"n Enter elements in array: "; for(int i=0;i<n;i++) cin>>ar[i]; // Sorting...
Circular Doubly Linked List in DSA C++ - DataFlair
Program 1 // Circular Double Linked List #include<iostream> #include<stdio.h> using namespace std; class Node { Node *ladd; int data; Node *radd; public: void create(); void display(); void reverseDisplay(); void insert_first(); void insert_middle(); void insert_last();...
Doubly Linked List in DSA C++ - DataFlair
Program 1 // Double Linked List #include<iostream> #include<stdio.h> using namespace std; class Node { Node *ladd; int data; Node *radd; public: void create(); void display(); void reverseDisplay(); void insert_first(); void insert_middle(); void insert_last(); void...
Circular Linked List in DSA C++ - DataFlair
Program 1 // Circular Linkedlist #include<iostream> #include<stdio.h> using namespace std; class Node { int data; Node *add; public: void create(); void insertFirst(); void insertMiddle(); void insertLast(); void deleteFirst(); void deleteMiddle(); void deleteLast(); void display();...
Stack using Linked List in DSA C++ - DataFlair
Program 1 // Stack Linked List #include<iostream> #include<stdio.h> using namespace std; class Node { int data; Node *add; public: void create(); void push(); void pop(); void display(); };Node *start=NULL,*new1,*temp,*prev1; void Node::create() { int n;...
Deque in DSA C++ - DataFlair
Program 1 #include<iostream> #include<stdio.h> #define clrscr() system("cls") using namespace std; #define MAXSIZE 10 int dqueue[MAXSIZE]; int front=-1,rear=-1; void insertFront(); void insertRear(); void deleteFront(); void deleteRear(); void display(); int main() { int choice; do {...
Linked List in DSA C++ - DataFlair
Program 1 #include<iostream> #include<stdio.h> using namespace std; class Node { int data; Node *add; public: void create(); void display(); void insert_first(); void insert_middle(); void insert_last(); void delete_first(); void delete_middle(); void delete_last(); void searchData(); void...
Queue Implementation using Linked List in DSA C++ - DataFlair
Program 1 // Queue Linked List #include<iostream> #include<stdio.h> using namespace std; class Node { int data; Node *add; public: void create(); void insert(); void delete1(); void display(); }; Node *start=NULL,*new1,*temp,*prev1; void Node::create() { int...
Linear Queue in DSA C++ - DataFlair
Program 1 // Linear Queue Implementation #include<iostream> #define MAXSIZE 5 using namespace std; class Queue { private: int queue[MAXSIZE]; int rear,front; public: Queue() { rear=-1; front=0; } void insert_element(); void delete_element(); void display_element(); };...
Circular Queue in DSA C++ - DataFlair
Program 1 // Linear Queue Implementation #include<iostream> #define MAXSIZE 10 using namespace std; class CircularQueue { private: int cqueue[MAXSIZE]; int rear,front; public: CircularQueue() { rear=front=-1; } void insert_element(); void delete_element(); void display_element(); }; void...
Binary Search in DSA using Python - DataFlair
Program 1 # Implementation of Binary Search import os os.system('cls') mylist=[] n=int(input("Enter the limit: ")) print("Enter an element: ") for i in range(n): x=int(input()) mylist.append(x) mylist.sort() s=int(input("Enter an element for search: ")) low=0 high=n-1...
Linear Sort in DSA using Python - DataFlair
Program 1 #Implementation of linear sort import os os.system('cls') mylist=[] n=int(input("Enter the limit : ")) print("Enter an elements ") for i in range(n): x=int(input()) mylist.append(x) for i in range(0,n): for j in range(i+1,n): if(mylist[j]<mylist[i]):...
Circular Doubly Linked List in DSA Python - DataFlair
Program 1 # Implementation of circular double linked list import os class Node: def __init__(self): self.ladd=None self.data=None self.radd=None class CircularDoubleList: def __init__(self): self.start=None self.count=0 def create(self): n=int(input("Enter first element: ")) self.start=Node() self.start.ladd=None self.start.data=n self.start.radd=None...