sundarlsr.github.io/index.html at main · sundarlsr/sundarlsr.github.io · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
<!DOCTYPE html>
<html>
<head>
<title>Common Algorithms</title>
<meta name="viewport" content="width=device-width, initial-scale=1">
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.7.0/css/font-awesome.min.css">
<style>
body {
  font-family: Arial, Helvetica, sans-serif;
  margin: 0;
}

.about-section {
  padding: 30px;
  text-align: center;
  background-color: #ff42a1;
  color: white;
}

.about-project {
  padding: 30px;
  text-align: justify;
  background-color: #fcd9f3;
  color: black;
}

/* Five columns side by side */
.column {
  float: left;
  width: 23%;
  margin-bottom: 16px;
  padding: 0 8px;
}

/* Display the columns below each other instead of side by side on small screens */
@media screen and (max-width: 650px) {
  .column {
    width: 100%;
    display: block;
  }
}

/* Add some shadows to create a card effect */
.card {
  box-shadow: 0 4px 8px 0 rgba(0, 0, 0, 0.2);
  margin-left: auto;
  margin-right: auto;
  text-align: center;
}

/* Some left and right padding inside the container */
.container {
  padding: 0 16px;
}

/* Clear floats */
.container::after, .row::after {
  content: "";
  clear: both;
  display: table;
}

.title {
  color: grey;
}

.button {
  border: none;
  outline: 0;
  display: inline-block;
  padding: 8px;
  color: white;
  background-color: #000;
  text-align: center;
  cursor: pointer;
  width: 100%;
}

.button:hover {
  background-color: #555;
}

</style>
</head>
<body>

<div class="about-section">
  <h1>Assignment 4</h1>
  <h2>Know more about the project team..</h2>
</div>

<div class="row">
  <div class="column">
    <div class="card">
      <div class="container">
        <h2 class="title">Vaishnavi V</h2>
        <p>Software Engineer</p>
        <p>2021mt93064@wilp-bits.pilani.ac.in</p>
        <p><a href="vaishnavi.html">
          <button class="button">Know More</button>
        </a></p>
      </div>
    </div>
  </div>

  <div class="column">
    <div class="card">
      <div class="container">
        <h2 class="title">Aishwarya</h2>
        <p>Software Engineer</p>
        <p>2021mt93220@wilp-bits.pilani.ac.in</p>
        <p><a href="aishwarya.html">
          <button class="button">Know More</button>
        </a></p>
      </div>
    </div>
  </div>

  <div class="column">
    <div class="card">
      <div class="container">
        <h2 class="title">Sundarraj L</h2>
        <p>Software Architect</p>
        <p>2021MT93180@wilp.bits-pilani.ac.in</p>
        <p><a href="sundar.html">
          <button class="button">Know More</button>
        </a></p>
      </div>
    </div>
  </div>

  <div class="column">
    <div class="card">
      <div class="container">
        <h2 class="title">Dipesh</h2>
        <p>Software Engineer</p>
        <p>2021mt93298@wilp-bits.pilani.ac.in</p>
        <p><a href="dipesh.html">
          <button class="button">Know More</button>
        </a></p>
      </div>
    </div>
  </div>

</div>

<div class="about-project">
  <h1>About the repository</h1>
  <h3>An open source repository that contains C++ implementation of commonly used algorithms in the programming world.</h3>
  <h4>Some algorithms included in this repository - </h4>
  <h5>Binary Search - Binary Search is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(Log n).</h5>
  <h5>Fibonacci Series - A program to generate a series of numbers in which each number (Fibonacci number) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc.</h5>
  <h5>Linked List - A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers.</h5>
  <h5>Stack Program - Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).</h5>
  <h5>Map Algorithm - A program that looks for the word entered by the user in a predefined dictionary.</h5>
  <h5>Transform Algorithm - A program that transforms a list into it's squared counterparts using the transform function.</h5>
  <h5>Reverse Integer - A program the reverses the integer entered by the user.</h5>
</div>

</body>
</html>