-
Does an existing version of firefox exist?
firefox --version
If not, skip to (3).
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* | |
*Created by: Mir Sahib | |
*Aug 18, 2017 | |
*8:15:46 PM | |
* | |
*/ | |
#include <iostream> | |
#include "list.h" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* | |
*List.h | |
* | |
*Created on: Aug 19, 2017 | |
* Author: Mir Sahib | |
* | |
*/ | |
#ifndef LIST_H_ | |
#define LIST_H_ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
void List::insertToNthPosition(int pos,int newData){ | |
temp = new node; | |
temp->data = newData; | |
temp->next = NULL; | |
if(pos==1){ | |
head = temp; | |
}else{ | |
curr = head; | |
for(int i=0;i<pos-2;i++){ | |
curr=curr->next; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//============================================================================ | |
// Name : Doubly_LinkedList.cpp | |
// Author : Mir Sahib | |
// Version : | |
// Copyright : MIT License | |
// Description : Doubly Linked List implementation | |
//============================================================================ | |
#include <iostream> | |
#include "List.h" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* | |
*List.h | |
* | |
*Created on: Sep 8, 2017 | |
* Author: Mir Sahib | |
* | |
*/ | |
#ifndef LIST_H_ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Author: Mir Sahib | |
ID:1510175 | |
Updated: 30 Sep 17 | |
*/ | |
#include <iostream> | |
using namespace std; | |
//pattern 1 a) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
class node{ | |
int data; | |
node* next; | |
} | |
class List{ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
void addAt(int index,int val){ | |
temp = new node; | |
temp->data = val; | |
int y = temp->data; | |
temp->next = NULL; | |
y = temp->data; | |
if(head==NULL){ | |
cout<<"The list is empty"<<endl; | |
y=temp->data; | |
}else if(index==0){ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//============================================================================ | |
// Name : LinkedList.cpp | |
// Author : Mir Sahib | |
// Version : 0.1(beta) | |
// Copyright : MIT License | |
// Description : Singly Linked List implementation | |
//============================================================================ | |
#include <iostream> |