mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-29 16:53:12 +03:00
Code Issues Packages Projects Releases Wiki Activity
680 Commits 13 Branches 0 Tags 32 MiB
dc5d25690b
Commit Graph

64 Commits

Author SHA1 Message Date
Krishna Vedala
99f299d172
Merge branch 'master' into project_euler/master2 2020-04-07 10:41:35 -04:00
Krishna Vedala
860b1fd501
added stdint.h for fixed width ints 2020-04-07 00:41:14 -04:00
Krishna Vedala
6a09ade47d
added stdint.h for fixed width ints 2020-04-07 00:39:42 -04:00
Krishna Vedala
fe5c6a724d
replace uint8 with unsigned char 2020-04-07 00:37:24 -04:00
Krishna Vedala
2d9d2d87fe
using the new function_timer library 2020-04-07 00:24:40 -04:00
Krishna Vedala
d24b6ea344
added option to enable or disable use of openmp 2020-04-07 00:24:13 -04:00
Krishna Vedala
1e7fc84c3a
added cmake to project euler 2020-04-07 00:12:34 -04:00
Krishna Vedala
855c9124b8
added stdint.h for integer length typedefs 2020-04-03 08:10:28 -04:00
Krishna Vedala
daca8c97e2
brute-force method 2020-04-02 23:50:51 -04:00
Krishna Vedala
1914f98fcd
Merge branch 'project_euler/problem_25' into project_euler/master2 
* project_euler/problem_25:
  solution using arbitrary number of digits took 11ms
 2020-04-02 20:15:57 -04:00
Krishna Vedala
3032428b65
Merge branch 'project_euler/problem_24' into project_euler/master2 
* project_euler/problem_24:
  algorithm by Dijkstra
 2020-04-02 20:15:48 -04:00
Krishna Vedala
52b83e3ca6
Merge branch 'project_euler/problem_23' into project_euler/master2 
* project_euler/problem_23:
  updating DIRECTORY.md
  move time computation inside loop + comments
  faster parallleization
  time computation inside the loop & print loop info
  added comments
  sol1 optimized by storing abundant numbers in a condensed array
  brute-force - compute abundant numbers every time

# Conflicts:
#	DIRECTORY.md
 2020-04-02 20:15:39 -04:00
Krishna Vedala
c0eaae7546
Merge branch 'project_euler/problem_22' into project_euler/master2 
* project_euler/problem_22:
  added source text file
  updating DIRECTORY.md
  sort using both lazy sort and shell-sort

# Conflicts:
#	DIRECTORY.md
 2020-04-02 20:13:14 -04:00
Krishna Vedala
3077a981dd
Merge branch 'project_euler/problem_21' into project_euler/master2 
* project_euler/problem_21:
  updating DIRECTORY.md
  speed optimized solution + optional OpenMP

# Conflicts:
#	DIRECTORY.md
 2020-04-02 20:10:30 -04:00
Krishna Vedala
feec93558c
Merge branch 'project_euler/problem_19' into project_euler/master2 
* project_euler/problem_19:
  updating DIRECTORY.md
  Project Euler / Problem 19

# Conflicts:
#	DIRECTORY.md
 2020-04-02 20:08:51 -04:00
Krishna Vedala
8279092455
solution using arbitrary number of digits 
took 11ms

(cherry picked from commit 54e3cdc92f81bebe8678257916766b5b8af9b2b0)
 2020-04-02 20:02:22 -04:00
Krishna Vedala
eecdadecd4
algorithm by Dijkstra 2020-04-02 18:23:12 -04:00
Krishna Vedala
fa24b792a7
move time computation inside loop + comments 2020-04-02 13:26:54 -04:00
Krishna Vedala
3598708121
faster parallleization 2020-04-02 13:25:26 -04:00
Krishna Vedala
ba31018aef
time computation inside the loop & print loop info 2020-04-02 13:23:51 -04:00
Krishna Vedala
f34164e601
added comments 2020-04-02 13:15:25 -04:00
Krishna Vedala
50a113addb
sol1 optimized by storing abundant numbers in a condensed array 2020-04-02 12:28:04 -04:00
Krishna Vedala
baaec2a3e0
brute-force - compute abundant numbers every time 2020-04-02 12:27:23 -04:00
Krishna Vedala
1d780f1a2f
added source text file 2020-04-02 01:14:31 -04:00
Krishna Vedala
a617fb71e5
sort using both lazy sort and shell-sort 
(cherry picked from commit 0cbea99c3e77736b571ef7702a7f6a3ce6a031be)
 2020-04-01 23:54:35 -04:00
Krishna Vedala
858856ea76
speed optimized solution + optional OpenMP 2020-04-01 21:09:42 -04:00
Krishna Vedala
d972d473f6
added computational time 2020-04-01 19:58:45 -04:00
Krishna Vedala
7706011fe0
added additional summary 2020-04-01 19:41:57 -04:00
Krishna Vedala
2c7944864b
make tmp variable unsigned 2020-04-01 19:35:45 -04:00
Krishna Vedala
d8ede0523a
added comments 2020-04-01 19:31:52 -04:00
Krishna Vedala
9083ea41dc
fixed signedness 2020-04-01 19:26:41 -04:00
Krishna Vedala
b7c579f79d
method 1 using linked lists for digits 2020-04-01 19:24:12 -04:00
Krishna Vedala
c751359c3f
Project Euler / Problem 19 2020-04-01 12:10:59 -04:00
Krishna Vedala
6ff4ac36d8
Merge branch 'project_euler/problem_16' into project_euler/master 
# Conflicts:
#	DIRECTORY.md
 2020-03-30 15:49:17 -04:00
Krishna Vedala
772da4e1ac
Merge branch 'project_euler/problem_15' into project_euler/master 
# Conflicts:
#	DIRECTORY.md
 2020-03-30 15:48:28 -04:00
Krishna Vedala
5e2dbc583b
Merge branch 'project_euler/problem_14' into project_euler/master 
# Conflicts:
#	DIRECTORY.md
 2020-03-30 15:47:30 -04:00
Krishna Vedala
471d3a9247
Merge branch 'project_euler/problem_13' into project_euler/master 
# Conflicts:
#	DIRECTORY.md
 2020-03-30 15:46:02 -04:00
Krishna Vedala
079938ea7c
algorithm from http://www.cplusplus.com/forum/beginner/68694/ 2020-03-30 15:43:16 -04:00
Krishna Vedala
1dc71abe93
combinatorial solution 2020-03-30 14:49:54 -04:00
Krishna Vedala
16cc1b71ff
added printf info 2020-03-30 11:42:49 -04:00
Krishna Vedala
6bfc6b691a
optimized solution with option to compile using platform independent OpenMP parallelization. 2020-03-30 11:25:15 -04:00
Krishna Vedala
944fbbea7c
solution using arbitrary length decimal number addition using array allocation 2020-03-30 10:48:24 -04:00
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
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
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
Krishna Vedala
ad84e9b08d
fixed bug when n=5000 2020-03-29 23:20:41 -04:00