Krishna Vedala
|
657c317957
|
added numbers as a text file
|
2020-03-30 09:25:07 -04:00 |
|
Krishna Vedala
|
c45653e074
|
Merge branch 'project_euler/problem_12' into project_euler/master
# Conflicts:
# DIRECTORY.md
|
2020-03-30 08:45:31 -04:00 |
|
Krishna Vedala
|
58d1d75958
|
added algorithm summary in comments
|
2020-03-30 08:42:43 -04:00 |
|
github-actions
|
f6536cc3be
|
updating DIRECTORY.md
|
2020-03-30 04:37:29 +00:00 |
|
Krishna Vedala
|
618614e5e1
|
Merge branch 'project_euler/problem_12' into project_euler/master
|
2020-03-30 00:36:47 -04:00 |
|
Krishna Vedala
|
51448a7399
|
Merge branch 'project_euler/problem_10' into project_euler/master
# Conflicts:
# DIRECTORY.md
|
2020-03-30 00:36:35 -04:00 |
|
Krishna Vedala
|
058da0b344
|
Merge branch 'project_euler/problem_09' into project_euler/master
* project_euler/problem_09:
updating DIRECTORY.md
optimized solution using only one loop copied from - https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_09/sol2.py
updating DIRECTORY.md
brute force method for Euler# 09
# Conflicts:
# DIRECTORY.md
|
2020-03-30 00:33:20 -04:00 |
|
Krishna Vedala
|
5d1ba02868
|
Merge branch 'project_euler/problem_08' into project_euler/master
|
2020-03-30 00:27:51 -04:00 |
|
github-actions
|
dc7cbdb768
|
updating DIRECTORY.md
|
2020-03-30 04:25:52 +00:00 |
|
Krishna Vedala
|
f6054c5d1c
|
algorithm implemented as presented in https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_12/sol2.py
|
2020-03-30 00:24:22 -04:00 |
|
github-actions
|
2a86cb9b95
|
updating DIRECTORY.md
|
2020-03-30 03:23:46 +00:00 |
|
Krishna Vedala
|
bba43f508e
|
ignore EXE files and vscode settings
|
2020-03-29 23:22:57 -04:00 |
|
Krishna Vedala
|
ad84e9b08d
|
fixed bug when n=5000
|
2020-03-29 23:20:41 -04:00 |
|
Krishna Vedala
|
feaf57d4a3
|
fixed error when n=5000
|
2020-03-29 23:13:01 -04:00 |
|
Krishna Vedala
|
747a50d3ca
|
Euler prob# 10 using sieve of Eratosthenes
|
2020-03-29 22:23:06 -04:00 |
|
Krishna Vedala
|
266383a700
|
add new-line to printf
|
2020-03-29 22:23:05 -04:00 |
|
Krishna Vedala
|
6e6e9e3d7e
|
brute force method to find primes and add them
|
2020-03-29 22:23:04 -04:00 |
|
github-actions
|
458404a6cb
|
updating DIRECTORY.md
|
2020-03-30 01:35:20 +00:00 |
|
Krishna Vedala
|
2ab1e5552d
|
Merge branch 'project_euler/problem_09' of github.com:kvedala/C into project_euler/problem_09
|
2020-03-29 21:34:51 -04:00 |
|
Krishna Vedala
|
51115bf0b9
|
optimized solution using only one loop
copied from - https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_09/sol2.py
|
2020-03-29 21:33:58 -04:00 |
|
github-actions
|
ebb887a253
|
updating DIRECTORY.md
|
2020-03-30 01:21:21 +00:00 |
|
Krishna Vedala
|
30bc9a201f
|
brute force method for Euler# 09
|
2020-03-29 21:20:49 -04:00 |
|
github-actions
|
01c80f1f44
|
updating DIRECTORY.md
|
2020-03-29 20:28:47 -04:00 |
|
github-actions
|
89a0e98035
|
updating DIRECTORY.md
|
2020-03-29 20:28:47 -04:00 |
|
Krishna Vedala
|
6dd882487e
|
an optimized solution - O(n) complexity
|
2020-03-29 20:28:46 -04:00 |
|
Krishna Vedala
|
6fa88fea35
|
brute-force method - O(n^2)
|
2020-03-29 20:28:46 -04:00 |
|
Krishna Vedala
|
0d1eb3551d
|
add input data as an ASCII text file
|
2020-03-29 20:28:32 -04:00 |
|
tania-cmyk
|
aac957c7a2
|
index now starts from 1
|
2020-02-02 13:45:59 +05:30 |
|
Christian Clauss
|
90e6ee0771
|
update_directory_md.yml: Remove GH Actions workaround
|
2020-01-27 22:37:32 +01:00 |
|
ttuanho
|
fd52c9f2c6
|
added more grah algos & Makefile, fixed som return non-void func errors
|
2020-01-17 20:10:31 +11:00 |
|
github-actions
|
807abcd0e8
|
updating DIRECTORY.md
|
2020-01-09 09:55:18 +00:00 |
|
Christian Clauss
|
a974dba4fd
|
Rename cartesianToPolar.c to cartesian_To_Polar.c
|
2020-01-09 10:55:04 +01:00 |
|
github-actions
|
6bbed39640
|
updating DIRECTORY.md
|
2020-01-09 09:54:36 +00:00 |
|
Christian Clauss
|
dc0374f848
|
Rename BucketSort.c to Bucket_Sort.c
|
2020-01-09 10:54:19 +01:00 |
|
github-actions
|
51fef6c0b9
|
updating DIRECTORY.md
|
2020-01-09 09:33:25 +00:00 |
|
Christian Clauss
|
d1fcf1ed87
|
Rename multikey_quicksort.c to multikey_quick_sort.c
|
2020-01-09 10:33:08 +01:00 |
|
github-actions
|
dfb63b0ce3
|
updating DIRECTORY.md
|
2020-01-09 09:28:45 +00:00 |
|
cclauss
|
ecb73860a3
|
Fix filenames for DIRECTORY.md
|
2020-01-09 10:27:32 +01:00 |
|
github-actions
|
cf3b6fba8c
|
updating DIRECTORY.md
|
2020-01-09 08:39:38 +00:00 |
|
Christian Clauss
|
e2c65cab9c
|
Remove header files
|
2020-01-09 09:39:24 +01:00 |
|
Christian Clauss
|
0f64d1949b
|
Update README.md
|
2020-01-09 09:36:32 +01:00 |
|
github-actions
|
54f4387a7a
|
updating DIRECTORY.md
|
2020-01-09 08:32:40 +00:00 |
|
Christian Clauss
|
1ac21a391f
|
C-Plus-Plus --> C
|
2020-01-09 09:32:25 +01:00 |
|
github-actions
|
3dc4c46408
|
updating DIRECTORY.md
|
2020-01-09 08:29:42 +00:00 |
|
Christian Clauss
|
c494f71131
|
Create update_directory_md.yml
This GitHub Action updates the DIRECTORY.md file (if needed) when doing a git push.
Copied from https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/.github/workflows/update_directory_md.yml
|
2020-01-09 09:29:24 +01:00 |
|
Hai Hoang Dang
|
c896b07e89
|
Merge pull request #507 from ericcurtin/patch-1
heapsort does not work for sorted input 1,2,3,4,5
|
2020-01-03 19:19:05 -08:00 |
|
Eric Curtin
|
5087249a17
|
heapsort does not work for sorted input 1,2,3,4,5
So I copied the C++ version from TheAlgorithms and re-wrote it in C.
Now it works.
|
2020-01-03 23:53:27 +00:00 |
|
orperes1
|
89a54ae41a
|
Create 872.c
|
2019-12-29 14:45:24 +02:00 |
|
Ashwek Swamy
|
70c11c370a
|
Merge pull request #497 from ubc1729/master
Indented "counting Sort" and fixed compilation errors
|
2019-11-09 23:34:53 +05:30 |
|
Ashwek Swamy
|
6159abcff1
|
format code
|
2019-11-09 23:34:40 +05:30 |
|