algorithm with no double nodes and nearly efficient enough still some optimizations to find for --big-superposition maps
19 lines
970 B
C
19 lines
970 B
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_isupper.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2018/04/09 10:10:12 by tmaze #+# #+# */
|
|
/* Updated: 2018/04/09 10:10:31 by tmaze ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "libft.h"
|
|
|
|
int ft_isupper(int c)
|
|
{
|
|
return (c >= 'A' && c <= 'Z');
|
|
}
|