mirror of
https://github.com/c0de-archive/hacktoberfest-2018.git
synced 2024-11-16 01:07:26 +00:00
Merge branch 'master' into patch-1
This commit is contained in:
commit
7261d5c422
@ -1,6 +1,8 @@
|
||||
Fixes or introduces:
|
||||
|
||||
:warning: This is a Pull Request Template :warning:
|
||||
> Checkout all the things you've done by placing an \*x*\ within the square braces.
|
||||
## Proposed Changes
|
||||
|
||||
-
|
||||
-
|
||||
- [ ] I've forked the repository.
|
||||
- [ ] I've created a branch and made my chagnes in it.
|
||||
- [ ] I've read the [CODE OF CONDUCT](https://github.com/my-first-pr/hacktoberfest-2018/blob/master/CODE_OF_CONDUCT.md) and abide to it.
|
||||
- [ ] I've read the [CONTRIBUTING.md](https://github.com/my-first-pr/hacktoberfest-2018/blob/master/CONTRIBUTING.md)
|
||||
- [ ] I understand opening a PULL REQUEST doesn't mean it will be merged for sure.
|
||||
|
181
README.md
181
README.md
@ -1,4 +1,4 @@
|
||||
![Open Source Love](https://img.shields.io/badge/Open%20Source-%E2%9D%A4-pink.svg)
|
||||
![Open Source Love](https://img.shields.io/badge/Open%20Source-%E2%9D%A4-pink.svg)
|
||||
![First Timers Only](https://img.shields.io/badge/first--timers--only-friendly-blue.svg?style=flat)
|
||||
![Up For Grabs](https://img.shields.io/badge/up--for--grabs-friendly-green.svg?style=flat)
|
||||
|
||||
@ -68,6 +68,16 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/adeonir)
|
||||
[![github-alt][github-img]](https://github.com/adeonir)
|
||||
|
||||
### Adhish Anand
|
||||
- Student, Chitkara University
|
||||
- Self-taught Developer, Aspiring Entreprenuer
|
||||
- I am currently work on:
|
||||
- Android Development
|
||||
- Python
|
||||
- Machine Learning
|
||||
- [![github-alt][github-img]](https://github.com/adhishanand9)
|
||||
|
||||
|
||||
### Aditya Choudhary
|
||||
- Software Engineer in India
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/webmasteradi)
|
||||
@ -245,6 +255,11 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![github-alt][github-img]](https://github.com/TheByteStuff )
|
||||
[![twitter-alt][twitter-img]](https://twitter.com/thebytestuff)
|
||||
|
||||
### Bruno Dulcetti
|
||||
- I'm a Front-End developer and work with React, React Native, Angular, AngularJS, ES6, CSS3, HTML5, UX and others technologies.
|
||||
- [![github-alt][github-img]](https://github.com/dulcetti )
|
||||
[![twitter-alt][twitter-img]](https://twitter.com/dulcetti)
|
||||
|
||||
# C
|
||||
|
||||
### Celso Uliana
|
||||
@ -333,6 +348,10 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/DusekDan)
|
||||
- [![github-alt][github-img]](https://github.com/DusekDan)
|
||||
|
||||
### Deddy
|
||||
- Developer wannabe.
|
||||
- [![github-alt][github-img]](https://github.com/Busterz)
|
||||
|
||||
# E
|
||||
|
||||
### Elijah Rwothoromo
|
||||
@ -341,6 +360,11 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/rwothoromo)
|
||||
[![github-alt][github-img]](https://github.com/rwothoromo)
|
||||
|
||||
### Evgeniy Vasilev
|
||||
- Software Developer
|
||||
- I'm a good man.
|
||||
- [![github-alt][github-img]](https://github.com/johnynsk)
|
||||
|
||||
# F
|
||||
|
||||
### festusdrakon
|
||||
@ -354,6 +378,11 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- Nerd, geek, gamer, I love TLoK
|
||||
- [![github-alt][github-img]](https://github.com/frannievas)
|
||||
|
||||
### Fabiane Souza
|
||||
- Software Developer who loves developing web and mobile. Always learning something new.
|
||||
- My hobbies include...
|
||||
- [![github-alt][github-img]](https://github.com/fabipriscila)
|
||||
|
||||
# G
|
||||
|
||||
### Gerlis A.C :computer: (@gerlis18)
|
||||
@ -387,6 +416,11 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/ganeshmajhi)
|
||||
[![github-alt][github-img]](https://github.com/ganeshmajhi)
|
||||
|
||||
### Geri Adam
|
||||
- PHP Developer From Indonesia
|
||||
- My First Hacktoberfest!
|
||||
- [![github-alt][github-img]](https://github.com/geriadam)
|
||||
|
||||
# H
|
||||
|
||||
### Hafpaf
|
||||
@ -431,6 +465,14 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![github-alt][github-img]](https://github.com/longhai18)
|
||||
|
||||
# I
|
||||
### Icaro Lima
|
||||
- I am a Brazilian SI student.
|
||||
- I like JavaScript and Python.
|
||||
- [![github-alt][github-img]](https://github.com/icarodgl)
|
||||
|
||||
### Iain Earl
|
||||
- DevOps Engineer, UK
|
||||
- [![github-alt][github-img]](https://github.com/itmecho)
|
||||
|
||||
### IGC
|
||||
- I am a Spanish CS student and developer.
|
||||
@ -490,6 +532,11 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- Learning Golang/Python and very interested in weareables/Fitness Tech
|
||||
- [![github-alt][github-img]](https://github.com/JClutch)
|
||||
|
||||
### Jatin Mehta
|
||||
- Wannabe Web Developer
|
||||
- I also love Python
|
||||
[![github-alt][github-img]](https://github.com/Exoceus)
|
||||
|
||||
### Jay Vasant
|
||||
- Python enthusiast.
|
||||
- My hobbies include:
|
||||
@ -512,11 +559,30 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- I love programming in C
|
||||
- [![github-alt][github-img]](https://github.com/jai37)
|
||||
|
||||
### João Canabarro
|
||||
- I'm a Brazilian SC.
|
||||
- I love programming in JavaScript and Python.
|
||||
- [![github-alt][github-img]](https://github.com/jcanabarro)
|
||||
|
||||
### Jack [REDACTED]
|
||||
- I'm a student in the United States
|
||||
- I like developing and doing graphic art!
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/jvcks0n)
|
||||
|
||||
|
||||
### John C
|
||||
- Hackerpreneur
|
||||
- I teach front end web development
|
||||
- Learning Elixir/Phoenix
|
||||
- [![github-alt][github-img]](https://github.com/thejohncotton)
|
||||
|
||||
### João Tavares
|
||||
- I'm graduated in business management, and now I pursue a carreer as a developer. Hope I can do it :)
|
||||
- I like doing some stuff on Photoshop and play guitar in my spare time.
|
||||
- [![facebook-alt][facebook-img]](https://www.facebook.com/joao.coelho.505)
|
||||
- [![github-alt][github-img]](https://github.com/vtavares11)
|
||||
|
||||
|
||||
# K
|
||||
|
||||
### Kamal Iqlaas
|
||||
@ -545,6 +611,12 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- I love playing and making games.
|
||||
- [![github-alt][github-img]](https://github.com/kundan28)
|
||||
|
||||
### Kusal Kahaduwa
|
||||
- I am an undergraduate.
|
||||
- I love AI, programming and web development.
|
||||
- I love playing games and waching movies.
|
||||
- [![github-alt][github-img]](https://github.com/kusalhasintha)
|
||||
|
||||
# L
|
||||
|
||||
### Lauren Reilly
|
||||
@ -558,6 +630,10 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- Electrical engineering student
|
||||
- A fair bit rusty in coding, hope to get back into it
|
||||
|
||||
### Letícia Maciel
|
||||
- Computer engineering student at UFPE
|
||||
- The future is female!
|
||||
|
||||
### Lincoln Anders
|
||||
- 1st year CS major at Georgia Tech
|
||||
- MERN full stack, primary interest in backend APIs
|
||||
@ -565,10 +641,25 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/lincolnanders5)
|
||||
[![github-alt][github-img]](https://github.com/lincolnanders5)
|
||||
|
||||
### Lokesh Raj Arora
|
||||
- I am a 22 year old self taught web developer, I love working on web technologies
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/thatlokiiguy)
|
||||
[![facebook-alt][facebook-img]](https://facebook.com/lokiiarora)
|
||||
[![github-alt][github-img]](https://github.com/lokiiarora)
|
||||
|
||||
### Lucas Gomes Flegler
|
||||
- Bachelor student in information systems and experience with Pentaho suite.
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/lukasgf18)
|
||||
[![github-alt][github-img]](https://github.com/lukasg18)
|
||||
|
||||
### Luis Chaglla
|
||||
- Software Engineer in Spain
|
||||
- [![github-alt][github-img]](https://github.com/lchaglla)
|
||||
|
||||
### Luiz Rosa
|
||||
- I'm a brazilian software developer, IoT enthusiast and currently front-end engineer. I am starting a fresh new project called [JegueCast](https://github.com/luizguilhermefr/JegueCast), a personal _localhost_ video streaming service.
|
||||
- [![github-alt][github-img]](https://github.com/luizguilhermefr)
|
||||
|
||||
### Luke Oliff
|
||||
- Technical Writer working for @auth0
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/mroliff)
|
||||
@ -588,6 +679,10 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/Magno_Macedo89)
|
||||
[![github-alt][github-img]](https://github.com/magnoDev)
|
||||
|
||||
### Mahmoud ElHussieni
|
||||
- R&D Engineer AI Enthusiast .
|
||||
[![github-alt][github-img]](https://github.com/MElHussieni)
|
||||
|
||||
### Manthan Keim
|
||||
- Bachelor student in Computer Science Engineering at MAIT.
|
||||
- I like movies, TV-series,reading books and listening songs.
|
||||
@ -601,6 +696,12 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/cynferdd)
|
||||
[![github-alt][github-img]](https://github.com/cynferdd)
|
||||
|
||||
### Maysa Borges
|
||||
- Graduated in Design, focused on UX and UI Design.
|
||||
- Hobbist illustrator and photographer.
|
||||
- [![github-alt][github-img]](https://github.com/maysaborges)
|
||||
[![facebook-alt][facebook-img]](https://www.facebook.com/maysabgama)
|
||||
|
||||
### Md Shahbaz Alam
|
||||
- I'm a Full Stack Developer, Technical Evangelist and Open Source enthusiast.
|
||||
- I like to speak at conferences, events and meet-ups.
|
||||
@ -675,6 +776,10 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- I'm a Computer Engineer.
|
||||
- [![github-alt][github-img]](https://github.com/omkar1212)
|
||||
|
||||
### Onnys Lopes Menete
|
||||
- I'm a Computer Engineer/Android Developer.
|
||||
- [![github-alt][github-img]](https://github.com/Onnys)
|
||||
|
||||
# P
|
||||
|
||||
### pankhuri22
|
||||
@ -710,10 +815,36 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- My favourite programming language is C++ and I'm a sport programmer.
|
||||
- [![github-alt][github-img]](https://github.com/ma5terdrag0n)
|
||||
|
||||
### Pijus Rancevas
|
||||
- Software Engineering student with background in arts.
|
||||
- Front End dev doing VR/ AR.
|
||||
- [![github-alt][github-img]](https://github.com/pijusrancevas)
|
||||
|
||||
### Prajwal
|
||||
- Software Developer.
|
||||
- First PR!
|
||||
- [![github-alt][github-img]](https://github.com/prajwalMR)
|
||||
|
||||
# Q
|
||||
|
||||
### Quang Vũ Nhật
|
||||
- I'm an Information Security Engineer.
|
||||
- I'm a back end programmer.
|
||||
- My current programming language is Python.
|
||||
- [![github-alt][github-img]](https://github.com/b3g00d)
|
||||
|
||||
# R
|
||||
|
||||
### Raahel Baig
|
||||
- Second year CS student at GVP, Vizag.
|
||||
- Just learned frontend development
|
||||
- Hobbies:
|
||||
- Coding
|
||||
- Writing
|
||||
- Cooking
|
||||
- Cricket
|
||||
- [![github-alt][github-img]](https://github.com/RaahelBa1g)
|
||||
|
||||
### rahman95
|
||||
- Software Developer born in Germany raised in the UK. 🇩🇪 🇬🇧
|
||||
- Hobbies include:
|
||||
@ -799,6 +930,12 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![facebook-alt][facebook-img]](https://facebook.com/rohit.kunji)
|
||||
[![github-alt][github-img]](https://github.com/ji-kun)
|
||||
|
||||
### Roxana Oanes
|
||||
- Studying web development
|
||||
- I am a gym passionate
|
||||
- I like reading and watching tv series
|
||||
[![github-alt][github-img]](https://github.com/roxyoanes)
|
||||
|
||||
### Rui Li
|
||||
- Software Engineer in NZ
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/RuiLi15)
|
||||
@ -823,6 +960,12 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- Description about me
|
||||
- [![github-alt][github-img]](https://github.com/samyak-sopho)
|
||||
|
||||
### Shivam Ralli
|
||||
- I am an Undergrad.
|
||||
- I am fascinated by the concept of Machine Learning and AI.
|
||||
- Apart from such inriguing concepts, I am a big fan of Data Science and reading fiction novels.
|
||||
- [![github-alt][github-img]](https://github.com/sralli)
|
||||
|
||||
### Shivani Gupta
|
||||
- I'm a computer science student.
|
||||
- I am Interested in Web Development.
|
||||
@ -840,12 +983,21 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- :heart: javascript enthusiast
|
||||
- [![github-alt][github-img]](https://github.com/shotozuro)
|
||||
|
||||
### Showndarya Madhavan
|
||||
- Final year student pursuing Computer Enginneering.
|
||||
- I love to code and am a Sci-Fi fan.
|
||||
- [![github-alt][github-img]](https://github.com/Showndarya)
|
||||
|
||||
### Shubham Nishad
|
||||
- Fourth year student in Computer Science.
|
||||
- you can check my site [https://shubhamnishad.com/](https://shubhamnishad.com/)
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/shubhamnishad97)
|
||||
[![github-alt][github-img]](https://github.com/shubhamnishad97)
|
||||
|
||||
### Shubham Patil
|
||||
- Python-Django, Java, C++
|
||||
- [![github-alt][github-img]](https://github.com/shubham76)
|
||||
|
||||
### Shweta Goyal
|
||||
- Computer Science Graduate
|
||||
- [![github-alt][github-img]](https://github.com/Shwetago)
|
||||
@ -861,6 +1013,12 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/QuotebotMaster)
|
||||
- [![github-alt][github-img]](https://github.com/souvikmaji)
|
||||
|
||||
### Sofrie
|
||||
- I'm a fullstack web developer
|
||||
- currently work in e-commerce
|
||||
- My hobbies include reading, watch movies, draw and sleeping
|
||||
- [![github-alt][github-img]](https://github.com/sofrie)
|
||||
|
||||
### Srishty Mittal
|
||||
- I'm a contributor and web developer
|
||||
- I study Electronics and Communication Engineering
|
||||
@ -894,6 +1052,11 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- I Love Gaming and Coding
|
||||
- [![github-alt][github-img]](https://github.com/TheNoodleMoose)
|
||||
|
||||
### Thereatra
|
||||
- IT student
|
||||
- New to coding
|
||||
- [![github-alt][github-img]](https://github.com/Thereatra)
|
||||
|
||||
### Thomas Kulmbach (D0Tch)
|
||||
- Webdeveloper working in Denmark
|
||||
- [![github-alt][github-img]](https://github.com/d0tch)
|
||||
@ -923,6 +1086,11 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/caomuss)
|
||||
[![github-alt][github-img]](https://github.com/caomus)
|
||||
|
||||
### Tor Morten Jensen
|
||||
- 29 year old full-stack developer living and working in Norway.
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/tormorten)
|
||||
[![github-alt][github-img]](https://github.com/tormjens)
|
||||
|
||||
# U
|
||||
|
||||
### Utkarsh Kunwar
|
||||
@ -959,12 +1127,23 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/vaibhav_a1997)
|
||||
[![github-alt][github-img]](https://github.com/vaibhavagarwal220)
|
||||
|
||||
### VaultVulp
|
||||
- Developer, Team Lead, Farther
|
||||
- [Blog](https://www.vaultvulp.tk/)
|
||||
- [![github-alt][github-img]](https://github.com/VaultVulp)
|
||||
|
||||
### Vidushi Jain
|
||||
- I'm a computer science student
|
||||
- Interested in app development
|
||||
- I love coding.
|
||||
- [![github-alt][github-img]](https://github.com/VidushiJain30)
|
||||
|
||||
### Vinod J
|
||||
- I'm a Software Engineer, working in a startup company
|
||||
- Frontend developer
|
||||
- [![github-alt][github-img]](https://github.com/VinodVJ)
|
||||
- [![twitter-alt][twitter-img]](https://twitter.com/Vinod70474537)
|
||||
|
||||
### Vishal Anand
|
||||
- Student
|
||||
- Programmer
|
||||
|
4
code/Exoceus.py
Normal file
4
code/Exoceus.py
Normal file
@ -0,0 +1,4 @@
|
||||
name = 'Jatin Mehta'
|
||||
greeting = "Hello World, I am "
|
||||
|
||||
print(greeting, name)
|
1
code/Harrish-Selvarajah.py
Normal file
1
code/Harrish-Selvarajah.py
Normal file
@ -0,0 +1 @@
|
||||
print("Hello, World!")
|
31
code/adhishanand9.cpp
Normal file
31
code/adhishanand9.cpp
Normal file
@ -0,0 +1,31 @@
|
||||
#include <iostream>
|
||||
#include <string>
|
||||
#include<stdio.h>
|
||||
#include<cstring>
|
||||
using namespace std;
|
||||
class GoodString
|
||||
{
|
||||
int t;
|
||||
public:
|
||||
GoodString(int x)
|
||||
{
|
||||
t=x;
|
||||
}
|
||||
|
||||
void newstring(string str)
|
||||
{
|
||||
for(int i=0;i<t;i++)
|
||||
cout<<str.at(i);
|
||||
}
|
||||
};
|
||||
int main ()
|
||||
{
|
||||
int n;
|
||||
cin>>n;
|
||||
GoodString ob(n);
|
||||
string str;
|
||||
getchar();
|
||||
getline(cin,str);
|
||||
ob.newstring(str);
|
||||
return 0;
|
||||
}
|
1
code/aka4rKO.boo
Normal file
1
code/aka4rKO.boo
Normal file
@ -0,0 +1 @@
|
||||
print "Hello, world!"
|
53
code/aka4rKO.exe
Normal file
53
code/aka4rKO.exe
Normal file
@ -0,0 +1,53 @@
|
||||
// C# implementation of recursive Binary Search
|
||||
using System;
|
||||
|
||||
class GFG
|
||||
{
|
||||
// Returns index of x if it is present in
|
||||
// arr[l..r], else return -1
|
||||
static int binarySearch(int []arr, int l,
|
||||
int r, int x)
|
||||
{
|
||||
if (r >= l)
|
||||
{
|
||||
int mid = l + (r - l)/2;
|
||||
|
||||
// If the element is present at the
|
||||
// middle itself
|
||||
if (arr[mid] == x)
|
||||
return mid;
|
||||
|
||||
// If element is smaller than mid, then
|
||||
// it can only be present in left subarray
|
||||
if (arr[mid] > x)
|
||||
return binarySearch(arr, l, mid-1, x);
|
||||
|
||||
// Else the element can only be present
|
||||
// in right subarray
|
||||
return binarySearch(arr, mid+1, r, x);
|
||||
}
|
||||
|
||||
// We reach here when element is not present
|
||||
// in array
|
||||
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, 0, n-1, x);
|
||||
|
||||
if (result == -1)
|
||||
Console.WriteLine("Element not present");
|
||||
else
|
||||
Console.WriteLine("Element found at index "
|
||||
+ result);
|
||||
}
|
||||
}
|
||||
|
||||
// This code is contributed by Sam007.
|
48
code/aka4rKO.java
Normal file
48
code/aka4rKO.java
Normal file
@ -0,0 +1,48 @@
|
||||
|
||||
// Java implementation of recursive Binary Search
|
||||
class BinarySearch
|
||||
{
|
||||
// Returns index of x if it is present in arr[l..
|
||||
// r], else return -1
|
||||
int binarySearch(int arr[], int l, int r, int x)
|
||||
{
|
||||
if (r>=l)
|
||||
{
|
||||
int mid = l + (r - l)/2;
|
||||
|
||||
// If the element is present at the
|
||||
// middle itself
|
||||
if (arr[mid] == x)
|
||||
return mid;
|
||||
|
||||
// If element is smaller than mid, then
|
||||
// it can only be present in left subarray
|
||||
if (arr[mid] > x)
|
||||
return binarySearch(arr, l, mid-1, x);
|
||||
|
||||
// Else the element can only be present
|
||||
// in right subarray
|
||||
return binarySearch(arr, mid+1, r, x);
|
||||
}
|
||||
|
||||
// We reach here when element is not present
|
||||
// in array
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Driver method to test above
|
||||
public static void main(String args[])
|
||||
{
|
||||
BinarySearch ob = new BinarySearch();
|
||||
int arr[] = {2,3,4,10,40};
|
||||
int n = arr.length;
|
||||
int x = 10;
|
||||
int result = ob.binarySearch(arr,0,n-1,x);
|
||||
if (result == -1)
|
||||
System.out.println("Element not present");
|
||||
else
|
||||
System.out.println("Element found at index " +
|
||||
result);
|
||||
}
|
||||
}
|
||||
/* This code is contributed by Rajat Mishra */
|
40
code/aka4rKO.py
Normal file
40
code/aka4rKO.py
Normal file
@ -0,0 +1,40 @@
|
||||
|
||||
# Python Program for recursive binary search.
|
||||
|
||||
# Returns index of x in arr if present, else -1
|
||||
def binarySearch (arr, l, r, x):
|
||||
|
||||
# Check base case
|
||||
if r >= l:
|
||||
|
||||
mid = l + (r - l)/2
|
||||
|
||||
# If element is present at the middle itself
|
||||
if arr[mid] == x:
|
||||
return mid
|
||||
|
||||
# If element is smaller than mid, then it
|
||||
# can only be present in left subarray
|
||||
elif arr[mid] > x:
|
||||
return binarySearch(arr, l, mid-1, x)
|
||||
|
||||
# Else the element can only be present
|
||||
# in right subarray
|
||||
else:
|
||||
return binarySearch(arr, mid+1, r, x)
|
||||
|
||||
else:
|
||||
# Element is not present in the array
|
||||
return -1
|
||||
|
||||
# Test array
|
||||
arr = [ 2, 3, 4, 10, 40 ]
|
||||
x = 10
|
||||
|
||||
# Function call
|
||||
result = binarySearch(arr, 0, len(arr)-1, x)
|
||||
|
||||
if result != -1:
|
||||
print "Element is present at index %d" % result
|
||||
else:
|
||||
print "Element is not present in array"
|
14
code/b3g00d.py
Normal file
14
code/b3g00d.py
Normal file
@ -0,0 +1,14 @@
|
||||
# -*- coding: utf-8 -*-
|
||||
|
||||
vn_greeting = u"Xin chào!"
|
||||
en_greeting = "Hello!"
|
||||
|
||||
if __name__ == "__main__":
|
||||
try:
|
||||
print((">>> print(meaning(\"{}\") == meaning(\"{}\"))").format(
|
||||
vn_greeting, en_greeting))
|
||||
except Exception:
|
||||
print((">>> print(meaning(\"{}\") == meaning(\"{}\"))").format(
|
||||
vn_greeting.encode("utf-8"), en_greeting))
|
||||
|
||||
print(True)
|
34
code/binary.py
Normal file
34
code/binary.py
Normal file
@ -0,0 +1,34 @@
|
||||
def binarySearch(arr, l, r, x):
|
||||
|
||||
while l <= r:
|
||||
|
||||
mid = l + (r - l)//2;
|
||||
|
||||
# Check if x is present at mid
|
||||
if arr[mid] == x:
|
||||
return mid
|
||||
|
||||
# If x is greater, ignore left half
|
||||
elif arr[mid] < x:
|
||||
l = mid + 1
|
||||
|
||||
# If x is smaller, ignore right half
|
||||
else:
|
||||
r = mid - 1
|
||||
|
||||
# If we reach here, then the element
|
||||
# was not present
|
||||
return -1
|
||||
|
||||
|
||||
# Test array
|
||||
arr = [ 2, 3, 4, 10, 40 ]
|
||||
x = 10
|
||||
|
||||
# Function call
|
||||
result = binarySearch(arr, 0, len(arr)-1, x)
|
||||
|
||||
if result != -1:
|
||||
print ("Element is present at index ",result)
|
||||
else:
|
||||
print ("Element is not present in array")
|
188
code/closestpairofpoints.cpp
Normal file
188
code/closestpairofpoints.cpp
Normal file
@ -0,0 +1,188 @@
|
||||
#include<iostream>
|
||||
#include<cstdlib>
|
||||
#include<cmath>
|
||||
#include<cfloat>
|
||||
#include<ctime>
|
||||
using namespace std;
|
||||
float xfirstx;
|
||||
float yfirsty;
|
||||
float xsecondx;
|
||||
float ysecondy;
|
||||
class mymath{
|
||||
public:
|
||||
float mysqrt(const float x){
|
||||
const double prec=0.00001;
|
||||
float low,high,anstry;
|
||||
if (x < 1){
|
||||
low = x;
|
||||
high = 1;
|
||||
}
|
||||
else{
|
||||
low = 1;
|
||||
high = x;
|
||||
}
|
||||
while ((high-low) > prec){
|
||||
anstry = (low+high)/2;
|
||||
if(anstry*anstry>x)
|
||||
high=anstry;
|
||||
else
|
||||
low=anstry;
|
||||
}
|
||||
return (low + high)/2;
|
||||
}
|
||||
};
|
||||
class points{
|
||||
float x;
|
||||
float y;
|
||||
public:
|
||||
float showx(){
|
||||
return x;
|
||||
}
|
||||
float showy(){
|
||||
return y;
|
||||
}
|
||||
void setx(float in){
|
||||
x=in;
|
||||
}
|
||||
void sety(float in){
|
||||
y=in;
|
||||
}
|
||||
int xpartition(points arr[],int p,int q){
|
||||
int k=p;
|
||||
for(int i=p+1;i<=q;i++){
|
||||
if(arr[i].showx()<arr[p].showx()){
|
||||
k++;
|
||||
points temp=arr[k];
|
||||
arr[k]=arr[i];
|
||||
arr[i]=temp;
|
||||
}
|
||||
}
|
||||
points temp=arr[p];
|
||||
arr[p]=arr[k];
|
||||
arr[k]=temp;
|
||||
return k;
|
||||
}
|
||||
int ypartition(points arr[],int p,int q){
|
||||
int k=p;
|
||||
for(int i=p+1;i<=q;i++){
|
||||
if(arr[i].showy()<arr[p].showy()){
|
||||
k++;
|
||||
points temp=arr[k];
|
||||
arr[k]=arr[i];
|
||||
arr[i]=temp;
|
||||
}
|
||||
}
|
||||
points temp=arr[p];
|
||||
arr[p]=arr[k];
|
||||
arr[k]=temp;
|
||||
return k;
|
||||
}
|
||||
void xquicksort(points arr[],int p,int q){
|
||||
if(p<q){
|
||||
int k=xpartition(arr,p,q);
|
||||
xquicksort(arr,p,k-1);
|
||||
xquicksort(arr,k+1,q);
|
||||
}
|
||||
}
|
||||
void yquicksort(points arr[],int p,int q){
|
||||
if(p<q){
|
||||
int k=ypartition(arr,p,q);
|
||||
yquicksort(arr,p,k-1);
|
||||
yquicksort(arr,k+1,q);
|
||||
}
|
||||
}
|
||||
float absolutevalue(float x){
|
||||
if(x<0) return -x;
|
||||
else return x;
|
||||
}
|
||||
|
||||
float dist(points a, points b){
|
||||
mymath callobj;
|
||||
return callobj.mysqrt(((a.showx()-b.showx())*(a.showx()-b.showx())+(a.showy()-b.showy())*(a.showy()-b.showy())));
|
||||
}
|
||||
float findinstrip(points strip[],float del,int length){
|
||||
float mind=del;
|
||||
int j;
|
||||
for(int i=0;i<length;i++){
|
||||
for(int j=i+1;j<length && strip[j].showy()-strip[i].showy()<mind;j++){
|
||||
if(strip[0].dist(strip[i],strip[j])<mind){
|
||||
mind=strip[0].dist(strip[i],strip[j]);
|
||||
xfirstx=strip[i].showx();
|
||||
yfirsty=strip[i].showy();
|
||||
xsecondx=strip[j].showx();
|
||||
ysecondy=strip[j].showy();
|
||||
}
|
||||
}
|
||||
}
|
||||
return mind;
|
||||
}
|
||||
float findclosestpair(points xsorted[],points ysorted[], int n){
|
||||
if(n<=5){
|
||||
static float d=FLT_MAX;
|
||||
for(int i=0;i<n;i++){
|
||||
for(int j=i+1;j<n;j++){
|
||||
if(xsorted[0].dist(xsorted[i],xsorted[j])<d){
|
||||
d=xsorted[0].dist(xsorted[i],xsorted[j]);
|
||||
xfirstx=xsorted[i].showx();
|
||||
yfirsty=xsorted[i].showy();
|
||||
xsecondx=xsorted[j].showx();
|
||||
ysecondy=xsorted[j].showy();
|
||||
}
|
||||
}
|
||||
}
|
||||
return d;
|
||||
}
|
||||
else{
|
||||
int mid=n/2;
|
||||
float xmid=xsorted[mid].showx();
|
||||
points yl[mid+1],yr[n-mid-1];
|
||||
int ylpos=0,yrpos=0;
|
||||
for(int i=0;i<n;i++){
|
||||
if(ysorted[i].showx()<=xmid){
|
||||
yl[ylpos]=ysorted[i];
|
||||
ylpos++;
|
||||
}
|
||||
else{
|
||||
yr[yrpos]=ysorted[i];
|
||||
yrpos++;
|
||||
}
|
||||
}
|
||||
float lmin=findclosestpair(xsorted,yl,mid+1);
|
||||
float rmin=findclosestpair(xsorted+mid+1,yr,n-mid-1);
|
||||
float del=min(lmin,rmin);
|
||||
int ypos=0;
|
||||
points ystrip[n];
|
||||
for(int i=0;i<n;i++){
|
||||
if(xsorted[0].absolutevalue(ysorted[i].showx()-xmid)<del){
|
||||
ystrip[ypos]=ysorted[i];
|
||||
ypos++;
|
||||
}
|
||||
}
|
||||
if(del<findinstrip(ystrip,del,ypos)) return del;
|
||||
else return findinstrip(ystrip,del,ypos);
|
||||
}
|
||||
}
|
||||
};
|
||||
int main(){
|
||||
int n;
|
||||
points callingobject;
|
||||
cout<<"Give the number of points : ";
|
||||
cin>>n;
|
||||
points input[n],xsorted[n],ysorted[n];
|
||||
// srand(time(NULL));
|
||||
for(int i=0;i<n;i++){
|
||||
input[i].setx(((float)(rand())/(float)(RAND_MAX))*(100));
|
||||
input[i].sety(((float)(rand())/(float)(RAND_MAX))*(100));
|
||||
xsorted[i]=input[i];
|
||||
ysorted[i]=input[i];
|
||||
}
|
||||
int time1=clock();
|
||||
callingobject.xquicksort(xsorted,0,n-1);
|
||||
callingobject.yquicksort(ysorted,0,n-1);
|
||||
float distance=callingobject.findclosestpair(xsorted,ysorted,n);
|
||||
int time2=clock();
|
||||
cout<<"The closest pair of points are ("<<xfirstx<<","<<yfirsty<<") and ("<<xsecondx<<","<<ysecondy<<")."<<endl;
|
||||
cout<<"The distance between them is "<<distance<<"."<<endl;
|
||||
cout<<"The time taken for the computation is "<<(time2-time1)<<" microseconds"<<endl;
|
||||
return 0;
|
||||
}
|
1
code/deepasha
Normal file
1
code/deepasha
Normal file
@ -0,0 +1 @@
|
||||
printf("hello world");
|
18
code/dulcetti.js
Normal file
18
code/dulcetti.js
Normal file
@ -0,0 +1,18 @@
|
||||
class Beer {
|
||||
constructor(name = 'Dulcetti', beerName = 'Karmeliet') {
|
||||
this.name = name;
|
||||
this.beerName = beerName;
|
||||
}
|
||||
|
||||
sayHello() {
|
||||
console.info(`Hello, ${ this.name }. Do you wanna a ${ this.beerName }?`)
|
||||
}
|
||||
}
|
||||
|
||||
// Hello with modified infos
|
||||
const myInfos = new Beer('Bruno', 'Duvel');
|
||||
myInfos.sayHello();
|
||||
|
||||
// Hello with default infos
|
||||
const defaultBeer = new Beer();
|
||||
defaultBeer.sayHello();
|
22
code/hacktober.go
Normal file
22
code/hacktober.go
Normal file
@ -0,0 +1,22 @@
|
||||
package main
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"time"
|
||||
"encoding/json"
|
||||
)
|
||||
|
||||
type Hacktober struct {
|
||||
Message string `json:"msg"`
|
||||
Date time.Time `json:"date"`
|
||||
}
|
||||
|
||||
func main () {
|
||||
data := Hacktober{
|
||||
Message: "Hello Hacktoberfest 2018!",
|
||||
Date: time.Now(),
|
||||
}
|
||||
|
||||
jsonBytes, _ := json.MarshalIndent(data, "", " ")
|
||||
fmt.Println(string(jsonBytes))
|
||||
}
|
62
code/kathylambert.html
Normal file
62
code/kathylambert.html
Normal file
@ -0,0 +1,62 @@
|
||||
<!DOCTYPE html>
|
||||
<head>
|
||||
<meta charset="utf-8">
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=edge">
|
||||
<title>Kathy Lambert Hacktoberfest 2018 Profile</title>
|
||||
<meta name="description" content="">
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1">
|
||||
<link rel="stylesheet" href="">
|
||||
<link href="https://use.fontawesome.com/releases/v5.0.6/css/all.css" rel="stylesheet">
|
||||
<link href="https://fonts.googleapis.com/css?family=Raleway" rel="stylesheet">
|
||||
|
||||
</head>
|
||||
<body>
|
||||
|
||||
<h1>Kathy Lambert</h1>
|
||||
<h3>Software Developer | Project Manager | Web Designer </h3>
|
||||
|
||||
<ul>
|
||||
<li>I am an intellectually curious individual with an insatiable desire to understand.</li>
|
||||
<li>I utilize my diverse background, experiences, and skills to help me be resourceful, organized and forward-thinking.</li>
|
||||
<li>I am actively looking for my first developer position post graduation from General Assembly's bootcamp.</li>
|
||||
<li>I ❤️ making the world beautiful one line of code at a time.</li>
|
||||
</ul>
|
||||
|
||||
<p>Get to know me better =>
|
||||
<a href="https://kathylambert.me">
|
||||
<i class="fas fa-laptop" style="color: #00B8CB"></i>
|
||||
</a>
|
||||
|
||||
<a href="https://github.com/Kathy145">
|
||||
<i class="icon fab fa-github" style="color: #00B8CB"></i>
|
||||
</a>
|
||||
|
||||
<a href="https://www.linkedin.com/in/k-lambert/">
|
||||
<i class="icon fab fa-linkedin" style="color: #00B8CB"></i>
|
||||
</a>
|
||||
|
||||
<a href="https://www.freecodecamp.org/kathy145">
|
||||
<i class="icon fab fa-free-code-camp" style="color: #00B8CB"></i>
|
||||
</a>
|
||||
|
||||
</p>
|
||||
|
||||
|
||||
<!-- <script src="" async defer></script> -->
|
||||
</body>
|
||||
|
||||
<style>
|
||||
:root {
|
||||
--main-font: 'Raleway', Helvetica, sans-serif;
|
||||
}
|
||||
|
||||
h1, h3, ul, p {
|
||||
font-family: var(--main-font)
|
||||
}
|
||||
|
||||
a {
|
||||
text-decoration: none;
|
||||
}
|
||||
|
||||
</style>
|
||||
</html>
|
41
code/laksh-ayy.html
Normal file
41
code/laksh-ayy.html
Normal file
@ -0,0 +1,41 @@
|
||||
<!DOCTYPE html>
|
||||
<html>
|
||||
<head>
|
||||
<link rel="stylesheet" type="text/css" href="Capstone_s.css">
|
||||
<title>Landing Page</title>
|
||||
</head>
|
||||
<body>
|
||||
<div class="anon">
|
||||
<h1>Welcome to the Landing Page!!</h1>
|
||||
<h2>We're a start up that does something</h2>
|
||||
<br>
|
||||
<br>
|
||||
<p>Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.</p>
|
||||
<br>
|
||||
<br>
|
||||
<p>Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.</p>
|
||||
<br>
|
||||
<br>
|
||||
<h2>Sign Up for an upcoming project!</h2>
|
||||
<form>
|
||||
<center>
|
||||
<label for="first">First Name</label>
|
||||
<br>
|
||||
<input id="first" type="text" name="first" placeholder="Lakshay" required>
|
||||
<br>
|
||||
<label for="last">Last Name</label>
|
||||
<br>
|
||||
<input id="last" type="text" name="last" placeholder="Khurana" required>
|
||||
<br>
|
||||
<label for="email">Email</label>
|
||||
<br>
|
||||
<input id="email" type="email" name="email" placeholder="apnaemail@domain.com" required>
|
||||
<br>
|
||||
<br>
|
||||
<input type="submit" value="Sign Up">
|
||||
<br>
|
||||
</center>
|
||||
</form>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
4
code/lokesh.purs
Normal file
4
code/lokesh.purs
Normal file
@ -0,0 +1,4 @@
|
||||
import Prelude
|
||||
import Effect.Console (log)
|
||||
|
||||
main = log("Hello World!")
|
3
code/ppbra.py
Normal file
3
code/ppbra.py
Normal file
@ -0,0 +1,3 @@
|
||||
##
|
||||
print('Hello, world!')
|
||||
##
|
3
code/tormjens.php
Normal file
3
code/tormjens.php
Normal file
@ -0,0 +1,3 @@
|
||||
<?php
|
||||
|
||||
echo 'Hello World';
|
14
code/try_except.py
Normal file
14
code/try_except.py
Normal file
@ -0,0 +1,14 @@
|
||||
while True:
|
||||
line = input()
|
||||
|
||||
if line:
|
||||
try:
|
||||
a = int(line)
|
||||
print("Correct!")
|
||||
exit(0)
|
||||
except ValueError as vr:
|
||||
print("Value Error:",vr)
|
||||
continue
|
||||
else:
|
||||
print("Enter something")
|
||||
continue
|
4
code/vakeeshanvictor-helloworld.pal
Normal file
4
code/vakeeshanvictor-helloworld.pal
Normal file
@ -0,0 +1,4 @@
|
||||
program Hello;
|
||||
begin
|
||||
writeln ('Hello, world.');
|
||||
end.
|
11
code/vakeeshanvictor-large_number.py
Normal file
11
code/vakeeshanvictor-large_number.py
Normal file
@ -0,0 +1,11 @@
|
||||
num1 = 10
|
||||
num2 = 14
|
||||
num3 = 12
|
||||
if (num1 >= num2) and (num1 >= num3):
|
||||
largest = num1
|
||||
elif (num2 >= num1) and (num2 >= num3):
|
||||
largest = num2
|
||||
else:
|
||||
largest = num3
|
||||
|
||||
print("The largest number between",num1,",",num2,"and",num3,"is",largest)
|
13
code/vakeeshanvictor.pal
Normal file
13
code/vakeeshanvictor.pal
Normal file
@ -0,0 +1,13 @@
|
||||
Program Lesson1_Program3;
|
||||
Var
|
||||
Num1, Num2, Sum : Integer;
|
||||
|
||||
Begin {no semicolon}
|
||||
Write('Input number 1:');
|
||||
Readln(Num1);
|
||||
Writeln('Input number 2:');
|
||||
Readln(Num2);
|
||||
Sum := Num1 + Num2; {addition}
|
||||
Writeln(Sum);
|
||||
Readln;
|
||||
End.
|
12
code/vakeeshanvictor.php
Normal file
12
code/vakeeshanvictor.php
Normal file
@ -0,0 +1,12 @@
|
||||
<!DOCTYPE html>
|
||||
<html>
|
||||
<body>
|
||||
|
||||
<h1>My first PHP page</h1>
|
||||
|
||||
<?php
|
||||
echo "Hello World!";
|
||||
?>
|
||||
|
||||
</body>
|
||||
</html>
|
22
code/vakeeshanvictor.py
Normal file
22
code/vakeeshanvictor.py
Normal file
@ -0,0 +1,22 @@
|
||||
import datetime
|
||||
now = datetime.datetime.now()
|
||||
print "-" * 25
|
||||
print now
|
||||
print now.year
|
||||
print now.month
|
||||
print now.day
|
||||
print now.hour
|
||||
print now.minute
|
||||
print now.second
|
||||
|
||||
print "-" * 25
|
||||
print "1 week ago was it: ", now - datetime.timedelta(weeks=1)
|
||||
print "100 days ago was: ", now - datetime.timedelta(days=100)
|
||||
print "1 week from now is it: ", now + datetime.timedelta(weeks=1)
|
||||
print "In 1000 days from now is it: ", now + datetime.timedelta(days=1000)
|
||||
|
||||
print "-" * 25
|
||||
birthday = datetime.datetime(2012,11,04)
|
||||
|
||||
print "Birthday in ... ", birthday - now
|
||||
print "-" * 25
|
Loading…
Reference in New Issue
Block a user