Add files via upload

Author: Zazzy1

List_Delete_Single.cpp

@@ -0,0 +1,15 @@
+void deleteNode(Node *ptr)
+{
+   //creating temporary pointer
+	Node *temp; 
+   //Pointing temp to link part of current node	i.e. next node
+	temp=ptr->link;
+   //copy data and link part of next node to current node
+	ptr->data=temp->data;
+   //point current node to link part of next node
+	ptr->link=temp->link;
+   //Delete current node
+	free(temp);
+
+}
+

a.txt

@@ -0,0 +1 @@
+i am a good boy

abc.png

@@ -0,0 +1,39 @@
+#include<iostream>
+using namespace std;
+int anagram(string s1,string s2)
+{
+int first[26] = {0}, second[26] = {0}, c = 0;
+while (s1[c] != '\0')
+  {
+    first[s1[c]-'a']++;
+    c++;
+  }
+ c = 0;
+ while (s2[c] != '\0')
+  {
+    second[s2[c]-'a']++;
+    c++;
+  }
+ // Comparing frequency of characters
+   for (c = 0; c < 26; c++)
+  {
+    if (first[c] != second[c])
+      return 0;
+    else
+        {cout<<first[c];
+        cout<<second[c]<<"\n";}
+
+  }
+
+  return 1;
+}
+int main()
+{
+string s1,s2;
+cin>>s1>>s2;
+if(anagram(s1,s2)==1)
+    cout<<"anagram";
+else
+    cout<<"not anagrma";
+return 0;
+}

anagram0(n).cpp

@@ -0,0 +1,33 @@
+#include<iostream>
+#include<string>
+#include<algorithm>
+using namespace std;
+
+bool isAnagram(string a,string b){
+int n1,n2;
+n1=a.length();
+n2=b.length();
+if(n1!=n2)
+    return false;
+
+    sort(a.begin(),a.end());
+    sort(b.begin(),b.end());
+for(int i=0;i<n1;i++)
+{if(a[i]!=b[i])
+return false;
+}
+
+return true;
+}
+int main()
+{
+string a,b;
+cin>>a>>b;
+bool ans;
+ans=isAnagram(a,b);
+if(ans==1)
+cout<<"anagram";
+else
+    cout<<"not anagram";
+return 0;
+}

anagram0(n).exe

@@ -0,0 +1,33 @@
+#include<iostream>
+#include<string>
+#include<algorithm>
+using namespace std;
+
+bool isAnagram(string a,string b){
+int n1,n2;
+n1=a.length();
+n2=b.length();
+if(n1!=n2)
+    return false;
+
+    sort(a.begin(),a.end());
+    sort(b.begin(),b.end());
+for(int i=0;i<n1;i++)
+{if(a[i]!=b[i])
+return false;
+}
+
+return true;
+}
+int main()
+{
+string a,b;
+cin>>a>>b;
+bool ans;
+ans=isAnagram(a,b);
+if(ans==1)
+cout<<"anagram";
+else
+    cout<<"not anagram";
+return 0;
+}

anagram0(n).o

@@ -0,0 +1 @@
+this is file b

anagramO(nlogn).cpp

@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std;
+struct node{
+int data;
+node* next;
+};
+node* head=NULL;
+int main(){
+    node* ptr= new node();
+    ptr->data=5;
+    ptr->next=NULL;
+    head=ptr;
+    delete ptr;
+    cout<<"data in 1st created node is "<<head->data<<"\n";
+    cout<<"next value address in 1st created node is "<<head->next<<"\n";
+    cout<<"ptr values after its deleted "<<ptr->data<<"\n"<<"next value of ptr aftr deletion"<<ptr->next;
+    //it frees the memory but still keeps record of the previous values
+    return 0;
+
+}

anagramO(nlogn)quickSort.cpp

@@ -0,0 +1,40 @@
+#include<stdio.h>
+int binarySearch(int Arr[], int n, int target) {
+
+	//set stating and ending index
+	int start = 0, ending = n-1;
+
+	while(start <= ending) {
+		// take mid of the list
+		int mid = (start + ending) / 2;
+
+		// we found a match
+		if(Arr[mid] == target) {
+			return mid;
+		}
+		// go on right side
+		else if(Arr[mid] < target) {
+			start = mid + 1;
+		}
+		// go on left side
+		else {
+			ending = mid - 1;
+		}
+	}
+	// element is not present in list
+	return -1;
+}
+int main()
+{
+int A[]={1,4,5,6,8,9,21};
+int x;
+printf("enter the target element\n");
+scanf("%d",&x);
+int index=binarySearch(A,7,x);
+if(index!=-1){
+    printf("index at %d",index+1);
+}
+else
+    printf("out of bound");
+return 0;
+}

anagramO(nlogn)quickSort.exe

@@ -0,0 +1 @@
+

anagramO(nlogn)quickSort.o

@@ -0,0 +1,29 @@
+#include<iostream>
+using namespace std;
+void bubbleSort(int A[],int n)
+{
+    for(int k=1;k<=n-1;k++){
+            int flag=0;
+        for(int i=0;i<=n-k-1;i++){
+            if(A[i]>A[i+1])
+            {
+            //swap(A[i],A[i+1])
+            int temp=A[i];
+            A[i]=A[i+1];
+            A[i+1]=temp;
+            flag=1;
+            }
+        }
+        if(flag==0)
+            break;
+    }
+}
+
+
+int main()
+{
+int A[]={4,5,8,7,9,3,2};
+bubbleSort(A,7);
+for(int i=0;i<7;i++)
+    cout<<A[i]<<" ";
+}

b.txt

@@ -0,0 +1 @@
+this is file c

basic linkedlist.cpp

@@ -0,0 +1 @@
+this is file d

basic linkedlist.exe

@@ -0,0 +1,16 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+int n,r,base=1,sum=0;
+cin>>n;
+while(n!=0)
+{
+r=n%2;
+sum+=r*base;
+n/=2;
+base*=10;
+}
+cout<<sum;
+return 0;
+}

basic linkedlist.o

@@ -0,0 +1,78 @@
+#include<iostream>
+#include<cstdlib>
+using namespace std;
+struct node{
+int data;
+node* next;
+};
+node* head=NULL;
+
+void deletebeg(){
+if(head==NULL){
+    cout<<"list is empty";
+}
+else{
+    node* ptr=head;
+    head=head->next;
+    free(ptr);
+}
+}
+void deleteend(){
+if(head==NULL)//no element
+    cout<<"empty list";
+else if(head->next==NULL){//if only 1 element present
+    node* ptr=head;
+    head=NULL;
+    free(ptr);
+}
+else{
+    node* ptr=head;
+    node* prev;//creating a pointer to previous node, so that we can delete the last node
+    while(ptr->next!=NULL){
+        prev=ptr;
+        ptr=ptr->next;
+    }
+    prev->next=NULL;
+    free(ptr);
+}
+}
+void insertbeg(int d){
+node* ptr=new node();
+ptr->data=d;
+ptr->next=head;
+head=ptr;
+}
+void insertend(int d){
+node* ptr=new node();
+ptr->data=d;
+ptr->next=NULL;
+if(head==NULL)
+    head=ptr;
+else{
+node* temp=head;
+while(temp->next!=NULL){
+    temp=temp->next;
+}
+temp->next=ptr;
+}
+}
+void display(){
+    node* temp=head;
+    while(temp!=NULL){
+        cout<<temp->data<<" ";
+        temp=temp->next;
+    }
+}
+int main(){
+insertbeg(8);
+insertbeg(7);
+insertend(9);
+insertend(10);
+insertend(12);
+display();
+cout<<"\n";
+deletebeg();
+deleteend();
+display();
+return 0;
+}