Merge branch 'master' into master

2026-05-22 13:47:55 +00:00 · 2018-10-01 14:16:02 -07:00
parent 056fac47a4 6800e22bfa
commit c94a8081f0
5 changed files with 144 additions and 0 deletions
@@ -21,6 +21,41 @@ This repository is for anyone to create pull requests during Hacktoberfest 2018,

 Start adding your names here:

+### Ananya
+- I'm a junior year student.
+- I am an Android Developer. I also work on other technologies such as web development using Django and Machine Learning.
+- I like to listen to music while I code.
+- [![facebook-alt][facebook-img]](https://www.facebook.com/ac.ananya)
+  [![github-alt][github-img]](https://github.com/ananya1304)
+
+### Anshima Chaudhary
+- I'm a contributor :)
+- I study CS 
+- My hobbies include coding, debating and dancing
+- [![github-alt][github-img]](https://github.com/anshima1)
+
+### Yash Agrawal
+- I am a student at IIT Mandi persuin B.Tech. in computer science.
+- I like more of competitive programming.
+- I am the co-ordinator of programming club, IIT Mandi.
+- [![github-alt][github-img]](https://github.com/YashAgrawal0)
+
+### Akshay N Shaju
+- Software Developer From India.🇧
+- Hobbies:
+  - Coding,
+  - Gaming
+- [![twitter-alt][twitter-img]](https://twitter.com/akshaynshaju)
+  [![github-alt][github-img]](https://github.com/Akshay-N-Shaju)
+
+### JillianAndersonSlate
+- I am a 25-year-old from the United States of America, and I recently moved with my husband to Barcelona, Spain.
+- As part of the move I have decided to pursue coding as a new career!
+- I am working toward a junior-level position doing front-end work with HTML, CSS, JavaScript, and React.
+- My other hobbies include reading, rock climbing, and re-watching 30 Rock and The Office :stuck_out_tongue_winking_eye: 
+- [![twitter-alt][twitter-img]](https://twitter.com/Jillifish17)
+  [![github-alt][github-img]](https://github.com/jillianandersonslate)
+
 ### BenTechy66
 - I am a young developer in England interested in node.js, python, C, and front-end web development frameworks
 - I'm currently a student!
@@ -30,6 +65,11 @@ Start adding your names here:
 - ~~Having a social life~~
  [![github-alt][github-img]](https://github.com/BenTechy66)

+###PatrickSedlacek
+-I am a recent graduate from University and recently started my career as a developer.
+-I volunteer with High School students teaching them programming and robotics.
+-I will have each of them participate in Hacktoberfest tonight!!
+
 ### duongoku
 - I'm a student and I'm in last year of highschool.
 - I'm interested in competitive programming, physics, calculus and tech stuff.
@@ -53,6 +93,12 @@ Start adding your names here:
 - I also like listening to music and watching movies.
 - [![github-alt][github-img]](https://github.com/lunamana104)

+### janicek1m
+- I am currently a high school student.
+- I love robotics, programming, and web-development.
+- I also like playing the cello, watching shows on Netflix, and cooking.
+- [![github-alt][github-img]](https://github.com/janicek1m)
+
 ### gursimran
 - I am a young developer in india
 - I'm currently a student!
@@ -95,6 +141,11 @@ Start adding your names here:
 - [![twitter-alt][twitter-img]](https://twitter.com/webmasteradi)
  [![github-alt][github-img]](https://github.com/adich23)

+### Vaibhav Agarwal
+- Fourth year undergraduate at IIT Mandi, Computer Science.
+- [![twitter-alt][twitter-img]](https://twitter.com/vaibhav_a1997)
+  [![github-alt][github-img]](https://github.com/vaibhavagarwal220)
+
 ### Mathieu Jolivet (Cynferdd)
 - Developper as a hobby since 1996, professionaly since 2005.
 - Bass player, I also love reading, photography and beer.
@@ -105,6 +156,21 @@ Start adding your names here:
 - DevOps Engineer
 - Taking part in my first Hacktober

+### Arjun Rajpal
+- Software Engineer and a ML Enthusiast
+- [![github-alt][github-img]](https://github.com/arjunrajpal)
+
+### Utkarsh Kunwar
+- Fourth year student in Mechanical Engineering.
+- [![github-alt][github-img]](https://github.com/UtkarshKunwar)
+
+### Anastasis Xouzafeiris (aka anksos)
+- I am a VMware engineer
+- I'm currently working as a Virtualization Specialist
+  [![twitter-alt][twitter-img]](https://twitter.com/ankso)
+  [![github-alt][github-img]](https://github.com/anksos)
+
+
 ### Example Profile
 - I'm an example that you can copy, if you want :)
 - I work for...
@@ -115,6 +181,18 @@ Start adding your names here:
  [![tumblr-alt][tumblr-img]](https://example.tumblr.com)
  [![dribbble-alt][dribbble-img]](https://dribbble.com/example)
  [![github-alt][github-img]](https://github.com/example)
+  
+  ### Suvin Nimnaka
+- A Student from Sri Lanka
+- [![twitter-alt][twitter-img]](https://twitter.com/tikirimaarie)
+  [![github-alt][github-img]](https://github.com/suvink)
+
+
+### Alok Rajasukumaran
+- AI Architect by profession
+- [!Know more at](https://alokraj68.in)
+- [![twitter-alt][twitter-img]](https://twitter.com/alokraj68)
+  [![github-alt][github-img]](https://github.com/alokraj68)

 ## How to Contribute

@@ -0,0 +1,3 @@
+##
+print('Hello, world!')
+##
@@ -0,0 +1,3 @@
+document.write("Hello World!");
+document.write("I am Alok Rajasukumaran. I am a Human");
+document.write("Know more here ==> https://alokraj68.in");
@@ -0,0 +1,38 @@
+// LANGUAGE: C#
+// TOPIC: Iterative Implementation of binary search algorithm
+using System;  
+class GFG { 
+	// Returns index of x if it is present in arr[],  
+    // else return -1 
+    static int binarySearch(int []arr, int x) { 
+        int l = 0, r = arr.Length - 1; 
+        while (l <= r) { 
+            int m = l + (r-l)/2; 
+            // Check if x is present at mid 
+            if (arr[m] == x) 
+                return m; 
+            // If x greater, ignore left half 
+            if (arr[m] < x) 
+                l = m + 1; 
+            // If x is smaller, ignore right half 
+            else
+                r = m - 1; 
+        } 
+        // if we reach here, then element was  
+        // not present 
+        return -1; 
+    } 
+    // Driver method to test above 
+    public static void Main() { 
+        int []arr = {2, 3, 4, 10, 40}; 
+        int n = arr.Length; 
+        int x = 10; 
+        int result = binarySearch(arr, x); 
+        if (result == -1) 
+            Console.WriteLine("Element not present"); 
+        else
+            Console.WriteLine("Element found at " +  
+                                "index " + result); 
+    } 
+}
+// end of file
@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+
+bool isOverlap(pair<int,int> p1,pair<int,int> p2,pair<int,int> p3,pair<int,int> p4){
+    if(p1.first>p4.first || p2.first<p3.first) return false;
+    if(p1.second<p4.second || p2.second>p3.second) return false;
+    return true;
+}
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        pair<int,int> p1,p2,p3,p4;
+        cin>>p1.first>>p1.second;
+        cin>>p2.first>>p2.second;
+        cin>>p3.first>>p3.second;
+        cin>>p4.first>>p4.second;
+        cout<<isOverlap(p1,p2,p3,p4)<<'\n';
+    }
+    return 0;
+}