backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-04 02:56:40 +08:00
Code Issues Projects Releases Wiki Activity

feat: Add ncr mod p code (#1325)

Browse Source 
* feat: Add ncr mod p code (#1323)

* Update math/ncr_modulo_p.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* Added all functions inside a class + added more asserts

* updating DIRECTORY.md

* clang-format and clang-tidy fixes for f6df24a5

* Replace int64_t to uint64_t + add namespace + detailed documentation

* clang-format and clang-tidy fixes for e09a0579

* Add extra namespace + add const& in function arguments

* clang-format and clang-tidy fixes for 8111f881

* Update ncr_modulo_p.cpp

* clang-format and clang-tidy fixes for 2ad2f721

* Update math/ncr_modulo_p.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update math/ncr_modulo_p.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* Update math/ncr_modulo_p.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>

* clang-format and clang-tidy fixes for 5b69ba5c

* updating DIRECTORY.md

* clang-format and clang-tidy fixes for a8401d4b

Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Kaustubh Damania
2020-11-22 23:05:01 +05:30
committed by GitHub
parent c8ce6f404c
commit 67e26cfbae
19 changed files with 1068 additions and 854 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
data_structures/list_array.cpp
View File

@@ -3,25 +3,27 @@
* @todo Add documentation
* @warning The sorting algorithm is erroneous
*/
#include <iostream>
#include <array>
#include <iostream>
struct list {
std::array<int, 50> data{};
int top = 0;
bool isSorted = false;
int BinarySearch(const std::array<int, 50>& dataArr, int first, int last, int x) {
int BinarySearch(const std::array<int, 50>& dataArr, int first, int last,
int x) {
if (last < first) {
return -1;
}
int mid = (first + last) / 2;
if (dataArr[mid] == x)
if (dataArr[mid] == x) {
return mid;
else if (x < dataArr[mid])
} else if (x < dataArr[mid]) {
return (BinarySearch(dataArr, first, mid - 1, x));
else if (x > dataArr[mid])
} else if (x > dataArr[mid]) {
return (BinarySearch(dataArr, mid + 1, last, x));
}
std::cerr << __func__ << ":" << __LINE__ << ": Undefined condition\n";
return -1;
@@ -38,7 +40,7 @@ struct list {
}
int Search(int x) {
int pos;
int pos = 0;
if (isSorted) {
pos = BinarySearch(data, 0, top - 1, x);
@@ -55,7 +57,7 @@ struct list {
}
void Sort() {
int i, j, pos=0;
int i = 0, j = 0, pos = 0;
for (i = 0; i < top; i++) {
int min = data[i];
for (j = i + 1; j < top; j++) {
@@ -119,8 +121,8 @@ struct list {
int main() {
list L;
int choice;
int x;
int choice = 0;
int x = 0;
do {
// Choices for operations on the list_array.
std::cout << "\n0.Exit";