INDIAN INSTITUTE OF TECHNOLOGY ROORKEE
Data Structures CSN- 102 Dr. R. Balasubramanian Associate Professor Department of Computer Science and Engineering Indian Institute of Technology Roorkee Roorkee 247 667
[email protected] https://sites.google.com/site/balaiitr/
#include
void easy(int N) { if (N < 1) return; easy(N-2); cout<
2
Examples int main() { int i, sum=0; int n; cin>>n; for (i=0; i
Time Complexity - O(n) Space complexity – O(1)
3
Examples int main() { int n; cin>>n; int *arr; arr=new int [n]; for (int i=0; i
Time Complexity - O(n2) Space complexity – O(n)
4
const int n=100; int main() { for (int i=0;i
Time Complexity - O(n2) Space complexity – O(n)
5
int n=64; steps=0; for (int i=1; i<=n;i*=2) steps++; cout<
Data Structures
Linear (Lists, Arrays, Linked lists, Stacks)
Non-Linear (Trees, Graphs…)
7
Course Website and FB group • https://sites.google.com/site/balaiitr/home/ds2016
• https://www.facebook.com/groups/372563019608601/
8