{"id":21354473,"url":"https://github.com/codeficct/numeros-enteros-poo","last_synced_at":"2025-03-16T05:22:09.583Z","repository":{"id":125527221,"uuid":"533964921","full_name":"codeficct/numeros-enteros-poo","owner":"codeficct","description":"✨ Práctico 1 de Numeros Enteros - Programación 1 - ing. Mollo ","archived":false,"fork":false,"pushed_at":"2022-09-28T13:43:20.000Z","size":68,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-22T17:46:53.725Z","etag":null,"topics":["class","ficct","mollo","object","poo","programacion","programacion-orientada-por-objetos","uagrm"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/codeficct.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-09-07T22:37:41.000Z","updated_at":"2024-01-06T17:20:40.000Z","dependencies_parsed_at":"2023-08-11T21:30:52.765Z","dependency_job_id":null,"html_url":"https://github.com/codeficct/numeros-enteros-poo","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeficct%2Fnumeros-enteros-poo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeficct%2Fnumeros-enteros-poo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeficct%2Fnumeros-enteros-poo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeficct%2Fnumeros-enteros-poo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/codeficct","download_url":"https://codeload.github.com/codeficct/numeros-enteros-poo/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243828224,"owners_count":20354452,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["class","ficct","mollo","object","poo","programacion","programacion-orientada-por-objetos","uagrm"],"created_at":"2024-11-22T04:13:30.923Z","updated_at":"2025-03-16T05:22:09.576Z","avatar_url":"https://github.com/codeficct.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Práctico de Números Enteros\n\n- 🧑🏻‍💻 Materia: Programación 1\n- 🚀 Lenguage: C#\n- 💅 Docente: Ing. Mollo\n- ⚡️ Facultad: [FICCT](https://www.facebook.com/FICCTUAGRMOFICIAL)\n- 📦 Paradigma: Programación orientada a objetos\n- 🧑🏻‍💻 Desarrollador: [@sauterdev](https://github.com/LuiSauter)\n\n## Contenido del Práctico\nDesarrollar el practico de la clase **Numero Entero** con las siguientes operaciones\nen **C#**:\n1. [Cargar](#1-cargar)\n2. [Descargar](#2-descargar)\n3. [Verificar si es par](#3-verificar-si-es-par)\n4. [Verificar si un numero entero es múltiplo de otro número entero](#4-verificar-si-un-numero-entero-es-múltiplo-de-otro-número-entero)\n5. [Verificar si un numero entero es sub múltiplo de otro número entero](#5-verificar-si-un-numero-entero-es-sub-múltiplo-de-otro-número-entero)\n6. [Verificar si es primo](#6-verificar-si-es-primo)\n7. [Verificar si es capicúa](#7-verificar-si-es-capicúa)\n8. [Verificar si es de la serie de Fibonacci](#8-verificar-si-es-de-la-serie-de-fibonacci)\n9. [Obtener el factorial de un numero entero](#9-obtener-el-factorial-de-un-numero-entero)\n10. [Verificar si los dígitos de un numero entero están ordenados](#10-verificar-si-los-dígitos-de-un-numero-entero-están-ordenados)\n\n**Primeros pasos**\nCrear la clase [IntegerNumber.cs](https://github.com/codeficct/numeros-enteros-poo/blob/main/IntegerNumber.cs) o NúmeroEntero.cs:\n```csharp\nusing System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - code here\n    }\n}\n```\n## 1. Cargar\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Cargar\n        public void setNumber(int value)\n        {\n            number = value;\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n## 2. Descargar\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Descargar\n        public int getNumber()\n        {\n            return number;\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n## 3. Verificar si es par\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Verificar si es Par\n        public bool isEven()\n        {\n            return number % 2 == 0;\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n## 4. Verificar si un numero entero es múltiplo de otro número entero\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Verificar si es multiplo de otro numero entero\n        public bool isMultiple(int multiple)\n        {\n            return number % multiple == 0;\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n## 5. Verificar si un numero entero es sub múltiplo de otro número entero\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Verificar si es sub-multiplo de otro numero entero\n        public bool isMultiple(int multiple)\n        {\n            return number % multiple == 0;\n        }\n\n        public bool isSubMultiple()\n        {\n            int index = 0;\n            bool result = false;\n            for (index = 1; index \u003c= number; index++)\n                if (isMultiple(index)) result = true;\n            return result;\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n## 6. Verificar si es primo\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Verificar si es Primo\n        public bool isPrime()\n        {\n            int index;\n            double half = Math.Sqrt(number);\n            for (index = 2; index \u003c= half; index++)\n            {\n                if (number % index == 0) return false;\n            }\n            return number \u003e 1;\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n## 7. Verificar si es capicúa\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Verificar si es capicúa o palindromo\n         public int reverseInteger()\n        {\n            int num, digit, result = 0;\n            num = number;\n            while (num \u003e 0)\n            {\n                digit = num % 10;\n                result = (result * 10) + digit;\n                num = num / 10;\n            }\n            return result;\n        }\n\n        public bool isPalindrome()\n        {\n            return reverseInteger() == number;\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n## 8. Verificar si es de la serie de Fibonacci\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Verificar si pertenece a Fibonacci\n        public bool checkIfIsFibonacci(int a = 0, int b = 1)\n        {\n            if (number == 0 || number == 1) return true;\n            int c = a + b;\n            if (c == number) return true;\n            else if (c \u003e number) return false;\n            return checkIfIsFibonacci(b, c);\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n## 9. Obtener el factorial de un numero entero\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Obtener el factorial\n        public double getFactorial()\n        {\n            double result = 1;\n            int index;\n            if (number != 0)\n            {\n                for (index = Math.Abs(number); index \u003e 1; index--)\n                {\n                    result = result * index;\n                }\n                if (number \u003c 0) result = -result;\n            }\n            return result;\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n## 10. Verificar si los dígitos de un numero entero están ordenados\n\n\u003cdetails\u003e\n  \u003csummary\u003eVer código\u003c/summary\u003e\n\n```csharp\nnamespace NumeroEntero_poo\n{\n    class IntegerNumber\n    {\n        // Properties\n        private int number;\n        // Constructor\n        public IntegerNumber()\n        {\n            number = 0;\n        }\n        // Methods - Verificar si los digitos\n        // de un número entero estan ordenados\n        public bool isOrder()\n        {\n            int[] numArray = new int[number];\n            int digit, clone = number, index = 1, numOrder = 0;\n            while (clone \u003e 0)\n            {\n                digit = clone % 10;\n                numArray[index] = digit;\n                clone = clone / 10;\n                index++;\n            }\n            Array.Sort(numArray);\n            foreach(int value in numArray)\n            {\n                numOrder = numOrder * 10 + value;\n            }\n            return number == numOrder;\n        }\n    }\n}\n```\n\n\u003c/details\u003e\n\n\n    ## Apuntes de la clase vector\n\n```csharp\npublic int FindSecuence(int element)\n{\n    int index = number; int flat = 0;\n    while ((index \u003c= number) \u0026\u0026 (flat == 0))\n    {\n        if (numbers[index] == element) flat = index;\n        else index--;\n    }\n    return flat;\n}\n\npublic int FindSecuence2(int element)\n{\n    int index = number, flag = 0, d = number;\n    while ((index \u003c= d) \u0026\u0026 (flag == 0))\n    {\n        if ((index == element) || (numbers[d] == element))\n        {\n            if (numbers[index] == element) flag = index;\n            else flag = d;\n        }\n        else\n        {\n            index++; d--;\n        }`\n    }\n    return flag;\n}\n\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodeficct%2Fnumeros-enteros-poo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodeficct%2Fnumeros-enteros-poo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodeficct%2Fnumeros-enteros-poo/lists"}